2016
DOI: 10.1016/j.proeng.2016.11.037
|View full text |Cite
|
Sign up to set email alerts
|

Watertight and 2-manifold Surface Meshes Using Dual Contouring with Tetrahedral Decomposition of Grid Cubes

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
4
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(4 citation statements)
references
References 12 publications
0
4
0
Order By: Relevance
“…Dual Contouring has no guarantees for reconstructing the correct topology of a given implicit surface. This is a fundamental issue of all reconstruction methods based on structured volumetric discretization and is subject to many studies but has not been resolved entirely yet [ZGG22; RSA16; Gro16]. In our case, this means that the topology might be incorrect at concave creases with an angle that is too small to be resolved by the octree.…”
Section: Resultsmentioning
confidence: 93%
“…Dual Contouring has no guarantees for reconstructing the correct topology of a given implicit surface. This is a fundamental issue of all reconstruction methods based on structured volumetric discretization and is subject to many studies but has not been resolved entirely yet [ZGG22; RSA16; Gro16]. In our case, this means that the topology might be incorrect at concave creases with an angle that is too small to be resolved by the octree.…”
Section: Resultsmentioning
confidence: 93%
“…The method just computes a single vertex for each cell in the octree, and therefore the resulting mesh might not be manifold. Subsequently different works were proposed that mainly deal with the problem of computing manifold meshes out of an octree [21,34,37]. All these methods generate hybrid meshes from a hierarchical data structure.…”
Section: Related Workmentioning
confidence: 99%
“…This is used to classify grid vertices v i ∈ V as 'inside' (T SDF (v i ) ≤ τ ) and 'outside' (T SDF (v i ) ≥ τ ). For each voxel, based on the arrangement of its grid vertices, marching cubes [20,[32][33][34] follows a lookup-table to find a triangle arrangement. Since this rasterization of iso-surface is a purely local operation, it often leads to ambiguities [34,32,33], resulting in meshes being non-manifold.…”
Section: Related Workmentioning
confidence: 99%
“…For each voxel, based on the arrangement of its grid vertices, marching cubes [20,[32][33][34] follows a lookup-table to find a triangle arrangement. Since this rasterization of iso-surface is a purely local operation, it often leads to ambiguities [34,32,33], resulting in meshes being non-manifold. Direct Mesh Prediction A mesh based representation stores the surface information cheaply as list of vertices and faces that respectively define the geometric and topological information.…”
Section: Related Workmentioning
confidence: 99%