VoroCrust: Voronoi Meshing Without Clipping
Skip to main content
eScholarship
Open Access Publications from the University of California

VoroCrust: Voronoi Meshing Without Clipping

  • Author(s): Abdelkader, Ahmed
  • Bajaj, Chandrajit L
  • Ebeida, Mohamed S
  • Mahmoud, Ahmed H
  • Mitchell, Scott A
  • Owens, John D
  • Rushdi, Ahmad A
  • et al.

Published Web Location

https://arxiv.org/abs/1902.08767
No data is associated with this publication.
Abstract

Polyhedral meshes are increasingly becoming an attractive option with particular advantages over traditional meshes for certain applications. What has been missing is a robust polyhedral meshing algorithm that can handle broad classes of domains exhibiting arbitrary curved boundaries and sharp features. In addition, the power of primal-dual mesh pairs, exemplified by Voronoi-Delaunay meshes, has been recognized as an important ingredient in numerous formulations. The VoroCrust algorithm is the first provably correct algorithm for conforming Voronoi meshing for non-convex and possibly non-manifold domains with guarantees on the quality of both surface and volume elements. A robust refinement process estimates a suitable sizing field that enables the careful placement of Voronoi seeds across the surface circumventing the need for clipping and avoiding its many drawbacks. The algorithm has the flexibility of filling the interior by either structured or random samples, while all sharp features are preserved in the output mesh. We demonstrate the capabilities of the algorithm on a variety of models and compare against state-of-the-art polyhedral meshing methods based on clipped Voronoi cells establishing the clear advantage of VoroCrust output.

Item not freely available? Link broken?
Report a problem accessing this item