Affiliation:
1. Ningbo University, China and Zhejiang University, China
2. Inria/Ecole Polytechnique, France
3. Zhejiang University, China
Abstract
Given a complex three-dimensional domain delimited by a closed and non-degenerate input triangle mesh without any self-intersection, a common geometry processing task consists in cutting up the domain into cells through a set of planar cuts, creating a "cut-cell mesh", i.e., a volumetric decomposition of the domain amenable to visualization (e.g., exploded views), animation (e.g., virtual surgery), or simulation (finite volume computations). A large number of methods have proposed either
efficient
or
robust
solutions, sometimes restricting the cuts to form a regular or adaptive grid for simplicity; yet, none can guarantee
both
properties, severely limiting their usefulness in practice. At the core of the difficulty is the determination of topological relationships among large numbers of vertices, edges, faces and cells in order to assemble a proper cut-cell mesh: while exact geometric computations provide a robust solution to this issue, their high computational cost has prompted a number of faster solutions based on, e.g., local floating-point angle sorting to significantly accelerate the process --- but losing robustness in doing so. In this paper, we introduce a new approach to planar cutting of 3D domains that substitutes topological inference for numerical ordering through a novel mesh data structure, and revert to exact numerical evaluations only in the few rare cases where it is strictly necessary. We show that our novel concept of
topological cuts
exploits the inherent structure of cut-cell mesh generation to save computational time while still guaranteeing exactness for, and robustness to, arbitrary cuts and surface geometry. We demonstrate the superiority of our approach over state-of-the-art methods on almost 10,000 meshes with a wide range of geometric and topological complexity. We also provide an open source implementation.
Funder
Natural Science Foundation of China
National Key Research and Development Program of China
Natural Science Foundation of Zhejiang Province
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Graphics and Computer-Aided Design
Reference31 articles.
1. Robust and Efficient Cartesian Mesh Generation for Component-Based Geometry
2. Indirect Predicates for Geometric Constructions
3. Preserving geometry and topology for fluid flows with thin obstacles and narrow gaps
4. Chandrajit L. Bajaj and Valerio Pascucci. 1996. Splitting a Complex of Convex Polytopes in Any Dimension . In Proceedings of the Twelfth Annual Symposium on Computational Geometry (SCG '96) . Association for Computing Machinery, New York, NY, USA, 88--97. Chandrajit L. Bajaj and Valerio Pascucci. 1996. Splitting a Complex of Convex Polytopes in Any Dimension. In Proceedings of the Twelfth Annual Symposium on Computational Geometry (SCG '96). Association for Computing Machinery, New York, NY, USA, 88--97.
5. Fast, Exact, Linear Booleans
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献