{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T09:40:27Z","timestamp":1775468427375,"version":"3.50.1"},"reference-count":22,"publisher":"MDPI AG","issue":"4","license":[{"start":{"date-parts":[[2009,11,11]],"date-time":"2009-11-11T00:00:00Z","timestamp":1257897600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>Recently a Delaunay refinement algorithm has been proposed that can mesh piecewise smooth complexes which include polyhedra, smooth and piecewise smooth surfaces, and non-manifolds. However, this algorithm employs domain dependent numerical predicates, some of which could be computationally expensive and hard to implement. In this paper we develop a refinement strategy that eliminates these complicated domain dependent predicates. As a result we obtain a meshing algorithm that is practical and implementation-friendly.<\/jats:p>","DOI":"10.3390\/a2041327","type":"journal-article","created":{"date-parts":[[2009,11,11]],"date-time":"2009-11-11T10:17:58Z","timestamp":1257934678000},"page":"1327-1349","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":28,"title":["Delaunay Meshing of Piecewise Smooth Complexes without Expensive Predicates"],"prefix":"10.3390","volume":"2","author":[{"given":"Tamal  K.","family":"Dey","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering, The Ohio State University, DL395, Columbus, OH, USA"}]},{"given":"Joshua  A.","family":"Levine","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, The Ohio State University, DL395, Columbus, OH, USA"}]}],"member":"1968","published-online":{"date-parts":[[2009,11,11]]},"reference":[{"key":"ref_1","unstructured":"Chew, L.P. (1989). Science Department, Cornell University."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Chew, L.P. (1993, January May). Guaranteed-quality mesh generation for curved surfaces. Proceedings of the 9th Symposium on Computational Geometry, San Diego, CA, USA.","DOI":"10.1145\/160985.161150"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1016\/j.gmod.2005.01.004","article-title":"Provably good sampling and meshing of surfaces","volume":"67","author":"Boissonnat","year":"2005","journal-title":"Graph. Models"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"1199","DOI":"10.1137\/060665889","article-title":"Sampling and meshing a surface with guaranteed topology and geometry","volume":"37","author":"Cheng","year":"2007","journal-title":"SIAM J. Comput."},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Shewchuk, J.R. (2000, January June). Mesh generation for domains with small angles. Proceedings of the 16th Symposium on Computational Geometry, Hong Kong, China.","DOI":"10.1145\/336154.336163"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Boissonnat, J.D., and Oudot, S. (2006, January June). Provably good sampling and meshing of Lipschitz surfaces. Proceedings of the 22nd Symposium on Computational geometry, Sedona, AZ, USA.","DOI":"10.1145\/1137856.1137906"},{"key":"ref_7","unstructured":"Rineau, L., and Yvinec, M. (2007, January October). Meshing 3D Domains Bounded by Piecewise Smooth Surfaces. Proceedings of the 16th International Meshing Roundtable, Seattle, WA, USA."},{"key":"ref_8","unstructured":"Cheng, S.W., Dey, T.K., and Ramos, E.A. (2007, January January). Delaunay refinement for piecewise smooth complexes. Proceedings of the 18th ACM-SIAM Symposium on Discrete Algorithms, New Orleans, LA, USA."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1007\/s00454-006-1252-5","article-title":"Three-Dimensional Delaunay Mesh Generation","volume":"36","author":"Cheng","year":"2006","journal-title":"Disc. Comput. Geom."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/j.comgeo.2004.03.001","article-title":"Conforming Delaunay triangulations in 3D","volume":"28","author":"Yvinec","year":"2004","journal-title":"Comput. Geom."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1142\/S0218195901000699","article-title":"A Point-Placement Strategy for Conforming Delaunay Tetrahedralization","volume":"11","author":"Murphy","year":"2001","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1137\/0216006","article-title":"Power Diagrams: Properties, Algorithms and Applications","volume":"16","author":"Aurenhammer","year":"1987","journal-title":"SIAM J. Comput."},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Edelsbrunner, H. (2001). Geometry and Topology for Mesh Generation, Cambridge University.","DOI":"10.1017\/CBO9780511530067"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"548","DOI":"10.1006\/jagm.1995.1021","article-title":"A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation","volume":"18","author":"Ruppert","year":"1995","journal-title":"J. Algorithms"},{"key":"ref_15","unstructured":"Cheng, S.W., Dey, T.K., and Levine, J.A. (2007, January October). A practical Delaunay meshing algorithm for a large class of domains. Proceedings of the 16th International Meshing Roundtable, Seattle, Washington, USA."},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Dey, T.K., and Levine, J.A. (2008, January June). DelPSC: a Delaunay mesher for piecewise smooth complexes (multimedia submission). Proceedings of the 24th ACM Symposium on Computational Geometry, College Park, MD, USA.","DOI":"10.1145\/1377676.1377712"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1142\/S0218195997000223","article-title":"Triangulating Topological Spaces","volume":"7","author":"Edelsbrunner","year":"1997","journal-title":"Int. J. Comput. Geometry Appl."},{"key":"ref_18","unstructured":"Cgal Computational Geometry Algorithms Library. Available online: http:\/\/www.cgal.org."},{"key":"ref_19","unstructured":"Oudot, S., Rineau, L., and Yvinec, M. (2005, January September). Meshing volumes bounded by smooth surfaces. Proceedings of the 14th International Meshing Roundtable, San Diego, CA, USA."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1007\/PL00009475","article-title":"Surface reconstruction by Voronoi filtering","volume":"22","author":"Amenta","year":"1999","journal-title":"Disc. Comput. Geom."},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Dey, T.K. (2007). Curve and Surface Reconstruction: Algorithms with Mathematical Analysis, Cambridge University.","DOI":"10.1017\/CBO9780511546860"},{"key":"ref_22","unstructured":"Amenta, N., and Dey, T. Normal variation with adaptive feature size. Available online: http:\/\/www.cse.ohio-state.edu\/ tamaldey\/paper\/norvar\/norvar.pdf."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/2\/4\/1327\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T22:11:37Z","timestamp":1760220697000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/2\/4\/1327"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,11,11]]},"references-count":22,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2009,12]]}},"alternative-id":["a2041327"],"URL":"https:\/\/doi.org\/10.3390\/a2041327","relation":{},"ISSN":["1999-4893"],"issn-type":[{"value":"1999-4893","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,11,11]]}}}