{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,5]],"date-time":"2026-04-05T09:07:43Z","timestamp":1775380063995,"version":"3.50.1"},"reference-count":42,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2002,5,1]],"date-time":"2002-05-01T00:00:00Z","timestamp":1020211200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":4131,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Geometry"],"published-print":{"date-parts":[[2002,5]]},"DOI":"10.1016\/s0925-7721(01)00054-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T10:02:47Z","timestamp":1027591367000},"page":"5-19","source":"Crossref","is-referenced-by-count":109,"title":["Triangulations in CGAL"],"prefix":"10.1016","volume":"22","author":[{"given":"Jean-Daniel","family":"Boissonnat","sequence":"first","affiliation":[]},{"given":"Olivier","family":"Devillers","sequence":"additional","affiliation":[]},{"given":"Sylvain","family":"Pion","sequence":"additional","affiliation":[]},{"given":"Monique","family":"Teillaud","sequence":"additional","affiliation":[]},{"given":"Mariette","family":"Yvinec","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/S0925-7721(01)00054-2_BIB001","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/116873.116880","article-title":"Voronoi diagrams: A survey of a fundamental geometric data structure","volume":"23","author":"Aurenhammer","year":"1991","journal-title":"ACM Comput. Surv."},{"key":"10.1016\/S0925-7721(01)00054-2_BIB002","unstructured":"B. Barber, Qhull, http:\/\/www.geom.umn.edu\/locate\/qhull, Version 2.3"},{"issue":"4","key":"10.1016\/S0925-7721(01)00054-2_BIB003","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1145\/235815.235821","article-title":"The quickhull algorithm for convex hulls","volume":"22","author":"Barber","year":"1996","journal-title":"ACM Trans. Math. Softw."},{"key":"10.1016\/S0925-7721(01)00054-2_BIB004","series-title":"Computing in Euclidean Geometry","first-page":"23","article-title":"Mesh generation and optimal triangulation","volume":"1","author":"Bern","year":"1992"},{"key":"10.1016\/S0925-7721(01)00054-2_BIB005","first-page":"29","article-title":"Algebraic specification of a 3D-modeler based on hypermaps","volume":"56","author":"Bertrand","year":"1994","journal-title":"CVGIP: Graph. Models Image Process."},{"key":"10.1016\/S0925-7721(01)00054-2_BIB006","series-title":"Algorithmic Geometry","author":"Boissonnat","year":"1998"},{"key":"10.1016\/S0925-7721(01)00054-2_BIB007","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/BF02189330","article-title":"Representing geometric structures in d dimensions: Topology and order","volume":"9","author":"Brisson","year":"1993","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0925-7721(01)00054-2_BIB008","series-title":"Proc. 14th Annual ACM Symp. Comput. Geom.","first-page":"165","article-title":"Interval arithmetic yields efficient dynamic filters for computational geometry","author":"Br\u00f6nnimann","year":"1998"},{"key":"10.1016\/S0925-7721(01)00054-2_BIB009","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/s003710050178","article-title":"A formal specification of geometric refinements","volume":"15","author":"Cazier","year":"1999","journal-title":"Visual Computer"},{"key":"10.1016\/S0925-7721(01)00054-2_BIB010","series-title":"Computational Geometry: Algorithms and Applications","author":"de Berg","year":"1997"},{"key":"10.1016\/S0925-7721(01)00054-2_BIB011","series-title":"Proc. 12th Annual ACM Symp. Comput. Geom.","first-page":"C5","article-title":"Simple traversal of a subdivision without extra storage","author":"de Berg","year":"1996"},{"key":"10.1016\/S0925-7721(01)00054-2_BIB012","unstructured":"O. Devillers, The Delaunay hierarchy, http:\/\/www-sop.inria.fr\/prisme\/logiciel\/del-hierarchy\/"},{"key":"10.1016\/S0925-7721(01)00054-2_BIB013","series-title":"Proc. 14th Annual ACM Symp. Comput. Geom.","first-page":"106","article-title":"Improved incremental randomized Delaunay triangulation","author":"Devillers","year":"1998"},{"key":"10.1016\/S0925-7721(01)00054-2_BIB014","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/S0925-7721(98)00039-X","article-title":"Checking the convexity of polytopes and the planarity of subdivisions","volume":"11","author":"Devillers","year":"1998","journal-title":"Comput. Geom. Theory Appl."},{"key":"10.1016\/S0925-7721(01)00054-2_BIB015","series-title":"Proc. 17th Annual ACM Symp. Comput. Geom.","article-title":"Walking in a triangulation","author":"Devillers","year":"2001"},{"key":"10.1016\/S0925-7721(01)00054-2_BIB016","series-title":"Walking in a triangulation, Rapport de recherche 4120","author":"Devillers","year":"2001"},{"key":"10.1016\/S0925-7721(01)00054-2_BIB017","series-title":"Proc. 2nd Annual ACM Symp. Comput. Geom.","first-page":"276","article-title":"A simple divide-and-conquer algorithm for computing Delaunay triangulations in O(nloglogn) expected time","author":"Dwyer","year":"1986"},{"key":"10.1016\/S0925-7721(01)00054-2_BIB018","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/BF01840356","article-title":"A faster divide-and-conquer algorithm for constructing Delaunay triangulations","volume":"2","author":"Dwyer","year":"1987","journal-title":"Algorithmica"},{"key":"10.1016\/S0925-7721(01)00054-2_BIB019","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/BF02187681","article-title":"Voronoi diagrams and arrangements","volume":"1","author":"Edelsbrunner","year":"1986","journal-title":"Discrete Comput. Geom."},{"issue":"2","key":"10.1016\/S0925-7721(01)00054-2_BIB020","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/BF02573974","article-title":"An upper bound for conforming Delaunay triangulations","volume":"10","author":"Edelsbrunner","year":"1993","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0925-7721(01)00054-2_BIB021","series-title":"On the design of CGAL, the Computational Geometry Algorithms Library, Research Report 3407","author":"Fabri","year":"1998"},{"key":"10.1016\/S0925-7721(01)00054-2_BIB022","series-title":"Abstracts 15th European Workshop Comput. Geom.","first-page":"169","article-title":"The design and implementation of planar maps in CGAL","author":"Flato","year":"1999"},{"key":"10.1016\/S0925-7721(01)00054-2_BIB023","doi-asserted-by":"crossref","first-page":"2140","DOI":"10.1103\/PhysRevE.62.2140","article-title":"Foundations of dissipative particle dynamics","volume":"62","author":"Flekk\u00f8y","year":"2000","journal-title":"Phys. Rev. E"},{"key":"10.1016\/S0925-7721(01)00054-2_BIB024","series-title":"Triangulation de Delaunay et maillage. Applications aux \u00e9l\u00e9ments finis","author":"George","year":"1997"},{"key":"10.1016\/S0925-7721(01)00054-2_BIB025","series-title":"GMP, The GNU Multiple Precision Arithmetic Library","author":"Granlund","year":"1996"},{"issue":"2","key":"10.1016\/S0925-7721(01)00054-2_BIB026","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1145\/282918.282923","article-title":"Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams","volume":"4","author":"Guibas","year":"1985","journal-title":"ACM Trans. Graph."},{"key":"10.1016\/S0925-7721(01)00054-2_BIB027","series-title":"Abstracts 15th European Workshop Comput. Geom.","first-page":"173","article-title":"A geometric approach to protein identification in 2D electrophoretic gel images","author":"Hoffmann","year":"1999"},{"key":"10.1016\/S0925-7721(01)00054-2_BIB028","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/S0925-7721(99)00007-3","article-title":"Using generic programming for designing a data structure for polyhedral surfaces","volume":"13","author":"Kettner","year":"1999","journal-title":"Comput. Geom. Theory and Appl."},{"key":"10.1016\/S0925-7721(01)00054-2_BIB029","unstructured":"LEDA, http:\/\/www.mpi-sb.mpg.de\/LEDA\/, Version 4.0"},{"issue":"3","key":"10.1016\/S0925-7721(01)00054-2_BIB030","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1142\/S0218195994000173","article-title":"N-dimensional generalized combinatorial maps and cellular quasi-manifolds","volume":"4","author":"Lienhardt","year":"1994","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"10.1016\/S0925-7721(01)00054-2_BIB031","unstructured":"D. Lischinski, Graphics Gems IV, ftp:\/\/wuarchive.wustl.edu\/graphics\/graphics\/books\/graphics-gems\/"},{"key":"10.1016\/S0925-7721(01)00054-2_BIB032","series-title":"Proc. 12th Annual ACM Symp. Comput. Geom.","first-page":"274","article-title":"Fast randomized point location without preprocessing in two- and three-dimensional Delaunay triangulations","author":"M\u00fccke","year":"1996"},{"key":"10.1016\/S0925-7721(01)00054-2_BIB033","series-title":"Proc. 7th Annual ACM Symp. Comput. Geom.","first-page":"121","article-title":"Randomized multidimensional search trees: Dynamic sampling","author":"Mulmuley","year":"1991"},{"key":"10.1016\/S0925-7721(01)00054-2_BIB034","series-title":"Proc. 11th ACM-SIAM Symp. Discrete Algorithms","first-page":"67","article-title":"A point-placement strategy for conforming Delaunay tetrahedralization","author":"Murphy","year":"2000"},{"key":"10.1016\/S0925-7721(01)00054-2_BIB035","series-title":"De la g\u00e9om\u00e9trie algorithmique au calcul g\u00e9om\u00e9trique, Th\u00e8se de Doctorat en Sciences","author":"Pion","year":"1999"},{"key":"10.1016\/S0925-7721(01)00054-2_BIB036","series-title":"Workshop on Applications of Interval Analysis to Systems and Control","first-page":"99","article-title":"Interval arithmetic: An efficient implementation and an application to computational geometry","author":"Pion","year":"1999"},{"key":"10.1016\/S0925-7721(01)00054-2_BIB037","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/BF01451597","article-title":"\u00dcber die Zerlegung von Dreieckspolyedern in Tetraeder","volume":"98","author":"Sch\u00f6nhardt","year":"1928","journal-title":"Mathematische Annalen"},{"key":"10.1016\/S0925-7721(01)00054-2_BIB038","series-title":"Applied Computational Geometry: Towards Geometric Engineering, First ACM Workshop on Applied Computational Geometry","first-page":"203","article-title":"Triangle: Engineering a 2D quality mesh generator and Delaunay triangulator","volume":"1148","author":"Shewchuk","year":"1996"},{"key":"10.1016\/S0925-7721(01)00054-2_BIB039","unstructured":"J.R. Shewchuk, Triangle. A two-dimensional quality mesh generator and Delaunay triangulator, http:\/\/www.cs.cmu.edu\/~quake\/triangle.html, Version 1.3"},{"key":"10.1016\/S0925-7721(01)00054-2_BIB040","series-title":"Proc. 12th Annual ACM Symp. Comput. Geom.","first-page":"141","article-title":"Robust adaptive floating-point geometric predicates","author":"Shewchuk","year":"1996"},{"key":"10.1016\/S0925-7721(01)00054-2_BIB041","series-title":"Proc. 14th Annual ACM Symp. Comput. Geom.","first-page":"76","article-title":"A condition guaranteeing the existence of higher-dimensional constrained Delaunay triangulations","author":"Shewchuk","year":"1998"},{"key":"10.1016\/S0925-7721(01)00054-2_BIB042","series-title":"Proceedings of the 6th Eurographics Workshop on Programming Paradigms in Graphics, Budapest, Hungary","first-page":"127","article-title":"Generic programming in CGAL, the Computational Geometry Algorithms Library","author":"Veltkamp","year":"1997"}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772101000542?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772101000542?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T15:26:55Z","timestamp":1556465215000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0925772101000542"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,5]]},"references-count":42,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2002,5]]}},"alternative-id":["S0925772101000542"],"URL":"https:\/\/doi.org\/10.1016\/s0925-7721(01)00054-2","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[2002,5]]}}}