Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2305.07570 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917096668004352 |
|---|---|
| author | Lipschütz, Henriette Reitebuch, Ulrich Polthier, Konrad Skrodzki, Martin |
| author_facet | Lipschütz, Henriette Reitebuch, Ulrich Polthier, Konrad Skrodzki, Martin |
| contents | 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 |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2305_07570 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Feature-aware manifold meshing and remeshing of point clouds and polyhedral surfaces with guaranteed smallest edge length Lipschütz, Henriette Reitebuch, Ulrich Polthier, Konrad Skrodzki, Martin Computational Geometry Data Structures and Algorithms 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 |
| title | Feature-aware manifold meshing and remeshing of point clouds and polyhedral surfaces with guaranteed smallest edge length |
| topic | Computational Geometry Data Structures and Algorithms |
| url | https://arxiv.org/abs/2305.07570 |