Feature-aware manifold meshing and remeshing of point clouds and polyhedral surfaces with guaranteed smallest edge length

May 12, 2023 Β· Declared Dead Β· πŸ› Comput. Aided Des.

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Henriette LipschΓΌtz, Ulrich Reitebuch, Konrad Polthier, Martin Skrodzki arXiv ID 2305.07570 Category cs.CG: Computational Geometry Cross-listed cs.DS Citations 1 Venue Comput. Aided Des. Last Checked 3 months ago
Abstract
Point clouds and polygonal meshes are widely used when modeling real-world scenarios. Here, point clouds arise, for instance, from acquisition processes applied in various surroundings, such as reverse engineering, rapid prototyping, or cultural preservation. Based on these raw data, polygonal meshes are created to, for example, run various simulations. For such applications, the utilized meshes must be of high quality. This paper presents an algorithm to derive triangle meshes from unstructured point clouds. The occurring edges have a close to uniform length and their lengths are bounded from below. Theoretical results guarantee the output to be manifold, provided suitable input and parameter choices. Further, the paper presents several experiments establishing that the algorithms can compete with widely used competitors in terms of quality of the output and timing and the output is stable under moderate levels of noise. Additionally, we expand the algorithm to detect and respect features on point clouds as well as to remesh polyhedral surfaces, possibly with features. Supplementary material, an extended preprint, a link to a previously published version of the article, utilized models, and implementation details are made available online: https://ms-math-computer.science/projects/guaranteed-smallest-edge-length-manifold-meshing.html
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Computational Geometry

R.I.P. πŸ‘» Ghosted

Dynamic Planar Convex Hull

Riko Jacob, Gerth StΓΈlting Brodal

cs.CG πŸ› The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings. πŸ“š 240 cites 7 years ago

Died the same way β€” πŸ‘» Ghosted