Abstract
Polygonal meshes are used to model smooth surfaces in many applications. Often these meshes need to be remeshed for improving the quality, density or gradedness. We apply the Delaunay refinement paradigm to design a provable algorithm for isotropic remeshing of a polygonal mesh that approximates a smooth surface. The proofs provide new insights and our experimental results corroborate the theory.
Similar content being viewed by others
References
Alliez P, de Verdière EC, Devillers O, Isenburg M (2003) Isotropic surface remeshing. Proc Shape Model Intern
Amenta N, Bern M (1999) Surface reconstruction by Voronoi filtering. Discret Comput Geom 22:481–504
Amenta N, Bern M, Eppstein D (1998) The crust and the β-skeleton: combinatorial curve reconstruction. Graph Models Image Process 60:125–135
Amenta N, Choi S, Dey TK, Leekha N (2002) A simple algorithm for homeomorphic surface reconstruction. Intern J Comput Geom Appl 12:125–141
Boissonnat J-D, Oudot S (2003) Provably good surface sampling and approximation. Eurograph Sympos Geom Process, pp 9–18
Chazal F, Lieutier A, Rossignac J (2005) OrthoMap: homeomorphism-guaranteeing normal-projection map between surfaces. In: ACM symposium on solid physics model (SPM), pp 9–14
Cheng H-L, Dey TK, Edelsbrunner H, Sullivan J (2001) Dynamic skin triangulation. Discret Comput Geom 25:525–568
Cheng S-W, Dey TK, Ramos EA, Ray T (2004) Sampling and meshing a surface with guaranteed topology and geometry. In: Proceedings of 20th annual symposium on computational geometry, pp 280–289
Cheng S-W, Dey TK, Ramos EA, Ray T (2005) Quality meshing for polyhedra with small angles. Intern J Comput Geom Appl 15:421–461
Chew LP (1989) Guaranteed-quality triangular meshes. Report TR-98-983, Computer Science Department, Cornell University, Ithaca
Chew LP (1993) Guaranteed-quality mesh generation for curved surfaces. In: Proceedings of 9th annual ACM symposium on computational geometry, pp 274–280
Dey TK (2006) Curve and surface reconstruction : algorithms with mathematical analysis. Cambridge University Press, New York
Edelsbrunner H, Shah N (1997) Triangulating topological spaces. Intern J Comput Geom Appl 7:365–378
Pav S, Walkington N (2004) A robust 3D Delaunay refinement algorithm. In: Proceedings of 13th international meshing roundtable
Pebay PP, Baker TJ (2001) Comparison of triangle quality measures. In: Proceedings of 10th international meshing roundtable. Sandia National Laboratories, Livermore, pp 327–340
Ruppert J (1995) A Delaunay refinement algorithm for quality 2-dimensional mesh generation. J Algorithms 18:548–585
Shewchuk JR (1998) Tetrahedral mesh generation by Delaunay refinement. In: Proceedings of 14th annual ACM symposium on computational geometry, pp 86–95
Sifri O, Sheffer A, Gotsman C (2003) Geodesic-based surface remeshing. In: Proceedings of international meshing roundtable
Acknowledgments
We acknowledge the support of Army Research Office, USA under Grant DAAD19-02-1-0347 and NSF, USA under Grants DMS-0310642 and CCR-0430735.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Dey, T.K., Ray, T. Polygonal surface remeshing with Delaunay refinement. Engineering with Computers 26, 289–301 (2010). https://doi.org/10.1007/s00366-009-0162-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00366-009-0162-1