TY - GEN
T1 - Repairing and meshing imperfect shapes with delaunay refinement
AU - Busaryev, Oleksiy
AU - Dey, Tamal K.
AU - Levine, Joshua A.
PY - 2009
Y1 - 2009
N2 - As a direct consequence of software quirks, designer errors, and representation flaws, often three-dimensional shapes are stored in formats that introduce inconsistencies such as small gaps and overlaps between surface patches. We present a new algorithm that simultaneously repairs imperfect geometry and topology while generating Delaunay meshes of these shapes. At the core of this approach is a meshing algorithm for input shapes that are piecewise smooth complexes (PSCs), a collection of smooth surface patches meeting at curves non-smoothly or in non-manifold configurations. Guided by a user tolerance parameter, we automatically merge nearby components while building a Delaunay mesh that has many of these errors fixed. Experimental evidence is provided to show the results of our algorithm on common computer-aided design (CAD) formats. Our algorithm may also be used to simplify shapes by removing small features which would require an excessive number of elements to preserve them in the output mesh.
AB - As a direct consequence of software quirks, designer errors, and representation flaws, often three-dimensional shapes are stored in formats that introduce inconsistencies such as small gaps and overlaps between surface patches. We present a new algorithm that simultaneously repairs imperfect geometry and topology while generating Delaunay meshes of these shapes. At the core of this approach is a meshing algorithm for input shapes that are piecewise smooth complexes (PSCs), a collection of smooth surface patches meeting at curves non-smoothly or in non-manifold configurations. Guided by a user tolerance parameter, we automatically merge nearby components while building a Delaunay mesh that has many of these errors fixed. Experimental evidence is provided to show the results of our algorithm on common computer-aided design (CAD) formats. Our algorithm may also be used to simplify shapes by removing small features which would require an excessive number of elements to preserve them in the output mesh.
KW - Delaunay mesh generation
KW - Piecewise-smooth complexes
KW - Shape repair
KW - Topology
UR - http://www.scopus.com/inward/record.url?scp=70350666513&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=70350666513&partnerID=8YFLogxK
U2 - 10.1145/1629255.1629259
DO - 10.1145/1629255.1629259
M3 - Conference contribution
AN - SCOPUS:70350666513
SN - 9781605587110
T3 - Proceedings - SPM 2009: SIAM/ACM Joint Conference on Geometric and Physical Modeling
SP - 25
EP - 33
BT - Proceedings - SPM 2009
T2 - SPM 2009: SIAM/ACM Joint Conference on Geometric and Physical Modeling
Y2 - 5 October 2009 through 8 October 2009
ER -