Publications

Abstract not provided.

Abstract not provided.

Abstract not provided.

Abstract not provided.

Abstract not provided.

Abstract not provided.

Abstract not provided.

Abstract not provided.

Abstract not provided.

Abstract not provided.

Abstract not provided.

Abstract not provided.

Abstract not provided.

Abstract not provided.

Abstract not provided.

Abstract not provided.

Abstract not provided.

Abstract not provided.

Abstract not provided.

Abstract not provided.

Abstract not provided.

Abstract not provided.

Over the past decade, polyhedral meshing has been gaining popularity as a better alternative to tetrahedral meshing in certain applications. Within the class of polyhedral elements, Voronoi cells are particularly attractive thanks to their special geometric structure. What has been missing so far is a Voronoi mesher that is sufficiently robust to run automatically on complex models. In this video, we illustrate the main ideas behind the VoroCrust algorithm, highlighting both the theoretical guarantees and the practical challenges imposed by realistic inputs.

We study the problem of decomposing a volume bounded by a smooth surface into a collection of Voronoi cells. Unlike the dual problem of conforming Delaunay meshing, a principled solution to this problem for generic smooth surfaces remained elusive. VoroCrust leverages ideas from α-shapes and the power crust algorithm to produce unweighted Voronoi cells conforming to the surface, yielding the first provably-correct algorithm for this problem. Given an ϵ-sample on the bounding surface, with a weak σ-sparsity condition, we work with the balls of radius δ times the local feature size centered at each sample. The corners of this union of balls are the Voronoi sites, on both sides of the surface. The facets common to cells on opposite sides reconstruct the surface. For appropriate values of ϵ, σ and δ, we prove that the surface reconstruction is isotopic to the bounding surface. With the surface protected, the enclosed volume can be further decomposed into an isotopic volume mesh of fat Voronoi cells by generating a bounded number of sites in its interior. Compared to state-of-the-art methods based on clipping, VoroCrust cells are full Voronoi cells, with convexity and fatness guarantees. Compared to the power crust algorithm, VoroCrust cells are not filtered, are unweighted, and offer greater flexibility in meshing the enclosed volume by either structured grids or random samples.

State estimation is a fundamental part of monitoring, control, and real-time optimization in continuous pharmaceutical manufacturing. For nonlinear dynamic systems with hard constraints, moving horizon estimation (MHE) can estimate the current state by solving a well-defined optimization problem where process complexities are explicitly considered as constraints. Traditional MHE techniques assume random measurement noise governed by some normal distributions. However, state estimates can be unreliable if noise is not normally distributed or measurements are contaminated with gross or systematic errors. To improve the accuracy and robustness of state estimation, we incorporate robust estimators within the standard MHE skeleton, leading to an extended MHE framework. The proposed MHE approach is implemented on two pharmaceutical continuous feeding–blending system (FBS) configurations which include loss-in-weight (LIW) feeders and continuous blenders. Numerical results show that our MHE approach is robust to gross errors and can provide reliable state estimates when measurements are contaminated with outliers and drifts. Moreover, the efficient solution of the MHE realized in this work, suggests feasible application of on-line state estimation on more complex continuous pharmaceutical processes.