Affiliation:
1. Computer Graphics Group, Universität Bern, Bern, Switzerland
2. Osnabrück University, Osnabrück, Germany
Abstract
Volumetric mapping is a ubiquitous and difficult problem in Geometry Processing and has been the subject of research in numerous and various directions. While several methods show encouraging results, the field still lacks a general approach with guarantees regarding map bijectivity. Through this work, we aim at opening the door to a new family of methods by providing a novel framework based on the concept of
progressive expansion.
Starting from an initial map of a tetrahedral mesh whose image may contain degeneracies but no inversions, we incrementally adjust vertex images to expand degenerate elements. By restricting movement to so-called
expansion cones
, it is done in such a way that the number of degenerate elements decreases in a strictly monotonic manner, without ever introducing any inversion. Adaptive local refinement of the mesh is performed to facilitate this process. We describe a prototype algorithm in the realm of this framework for the computation of maps from ball-topology tetrahedral meshes to convex or star-shaped domains. This algorithm is evaluated and compared to state-of-the-art methods, demonstrating its benefits in terms of bijectivity. We also discuss the associated cost in terms of sometimes significant mesh refinement to obtain the necessary degrees of freedom required for establishing a valid mapping. Our conclusions include that while this algorithm is only of limited immediate practical utility due to efficiency concerns, the general framework has the potential to inspire a range of novel methods improving on the efficiency aspect.
Funder
European Research Council
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Graphics and Computer-Aided Design
Reference42 articles.
1. Barycentric Subdivisions of Convex Complexes are Collapsible
2. Injective and bounded distortion mappings in 3D
3. Orbifold Tutte embeddings
4. Marc Alexa . 2023. Tutte Embeddings of Tetrahedral Meshes. Discrete & Computational Geometry ( 2023 ). Marc Alexa. 2023. Tutte Embeddings of Tetrahedral Meshes. Discrete & Computational Geometry (2023).
5. Adaptive unstructured volume remeshing – I: The method
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献