{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T23:44:49Z","timestamp":1774136689371,"version":"3.50.1"},"reference-count":33,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1992,7,1]],"date-time":"1992-07-01T00:00:00Z","timestamp":709948800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["CVGIP: Graphical Models and Image Processing"],"published-print":{"date-parts":[[1992,7]]},"DOI":"10.1016\/1049-9652(92)90076-a","type":"journal-article","created":{"date-parts":[[2004,7,1]],"date-time":"2004-07-01T23:14:21Z","timestamp":1088723661000},"page":"290-300","source":"Crossref","is-referenced-by-count":54,"title":["An on-line algorithm for constrained Delaunay triangulation"],"prefix":"10.1016","volume":"54","author":[{"given":"L","family":"De Floriani","sequence":"first","affiliation":[]},{"given":"E","family":"Puppo","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/1049-9652(92)90076-A_BIB1","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/BF01840436","article-title":"Visibility of disjoint polygons","volume":"1","author":"Asano","year":"1986","journal-title":"Algorithmica"},{"issue":"2","key":"10.1016\/1049-9652(92)90076-A_BIB2","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1137\/0713021","article-title":"On the angle condition in the finite element method","volume":"13","author":"Babuska","year":"1976","journal-title":"SIAM J. Numer. Anal."},{"key":"10.1016\/1049-9652(92)90076-A_BIB3","series-title":"Mathematical Software III","first-page":"69","article-title":"Representation and approximation of surfaces","author":"Barnhill","year":"1977"},{"key":"10.1016\/1049-9652(92)90076-A_BIB4","doi-asserted-by":"crossref","DOI":"10.6028\/NIST.TN.1252","article-title":"On constructing Delaunay triangulations for sets of constrained line segments","author":"Bernal","year":"1988"},{"issue":"4","key":"10.1016\/1049-9652(92)90076-A_BIB5","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1145\/357346.357349","article-title":"Geometric structures for three dimensional shape representation","volume":"3","author":"Boissonnat","year":"1984","journal-title":"ACM Trans. Graphics"},{"key":"10.1016\/1049-9652(92)90076-A_BIB6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0734-189X(88)80028-8","article-title":"Shape reconstruction from planar cross sections","volume":"44","author":"Boissonnat","year":"1988","journal-title":"Comput. Vision Graphics Image Process."},{"key":"10.1016\/1049-9652(92)90076-A_BIB7","doi-asserted-by":"crossref","first-page":"809","DOI":"10.1090\/S0025-5718-1970-0282540-0","article-title":"Triangular elements in the finite element method","volume":"24","author":"Bramble","year":"1970","journal-title":"Math. Comp."},{"key":"10.1016\/1049-9652(92)90076-A_BIB8","series-title":"Proceedings, International Workshop on Visual Form","article-title":"Three-dimensional surface reconstruction using Delaunay triangulation in the image plane","author":"Bruzzone","year":"1991"},{"key":"10.1016\/1049-9652(92)90076-A_BIB9","doi-asserted-by":"crossref","first-page":"679","DOI":"10.1002\/nme.1620080402","article-title":"Automatic triangulation of arbitrary planar domains for the finite element method","volume":"8","author":"Cavendish","year":"1978","journal-title":"Int. J. Numer. Methods Engrg."},{"key":"10.1016\/1049-9652(92)90076-A_BIB10","series-title":"Proceedings, 21st Allerton Conference Commun. Control Comput.","first-page":"447","article-title":"Triangulating a polygon by divide-and-conquer","author":"Chazelle","year":"1983"},{"key":"10.1016\/1049-9652(92)90076-A_BIB11","series-title":"Proceedings, Third ACM Symposium on Computational Geometry","first-page":"216","article-title":"Constrained Delaunay triangulation","author":"Chew","year":"1987"},{"key":"10.1016\/1049-9652(92)90076-A_BIB12","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/BF02187740","article-title":"Application of random sampling in computational geometry, II","volume":"4","author":"Clarkson","year":"1989","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/1049-9652(92)90076-A_BIB13","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0734-189X(85)90005-2","article-title":"A Delaunay-based representation of surfaces defined over arbitrarily-shaped domains","volume":"32","author":"De Floriani","year":"1985","journal-title":"Comput. Vision Graphics Image Process."},{"key":"10.1016\/1049-9652(92)90076-A_BIB14","series-title":"Proceedings, Ninth International Conference on Pattern Recognition","article-title":"Constrained Delaunay triangulation for multiresolution surface description","author":"De Floriani","year":"1988"},{"key":"10.1016\/1049-9652(92)90076-A_BIB15","article-title":"A pyramidal data structure for triangle-based surface description","volume":"Mar.","author":"De Floriani","year":"1989"},{"key":"10.1016\/1049-9652(92)90076-A_BIB16","article-title":"An On-Line Algorithm for Constrained Triangulation","author":"Floriani","year":"1991"},{"key":"10.1016\/1049-9652(92)90076-A_BIB17","author":"Edelsbrunner","year":"1987"},{"key":"10.1016\/1049-9652(92)90076-A_BIB18","series-title":"Proceedings, Second ACM Symposium on Computational Geometry","first-page":"246","article-title":"Implementing Watson's algorithm in three-dimensions","author":"Field","year":"1986"},{"key":"10.1016\/1049-9652(92)90076-A_BIB19","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1145\/965103.807444","article-title":"Automatic extraction of irregular digital terrain models","volume":"13","author":"Fowler","year":"1979","journal-title":"Comput. Graphics"},{"key":"10.1016\/1049-9652(92)90076-A_BIB20","article-title":"Duality and Construction of Constrained Voronoi Diagram and Delaunay Triangulations","author":"Joe","year":"1989"},{"key":"10.1016\/1049-9652(92)90076-A_BIB21","series-title":"Mathematical Software III","first-page":"161","article-title":"Software for C1 surface interpolation","author":"Lawson","year":"1977"},{"key":"10.1016\/1049-9652(92)90076-A_BIB22","article-title":"Proximity and Reachability in the Plane","author":"Lee","year":"1978"},{"issue":"3","key":"10.1016\/1049-9652(92)90076-A_BIB23","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/BF00977785","article-title":"Two algorithms for constructing a Delaunay triangulation","volume":"9","author":"Lee","year":"1980","journal-title":"Internat. Comput. Inform. Sci."},{"key":"10.1016\/1049-9652(92)90076-A_BIB24","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/BF02187695","article-title":"Generalized Delaunay triangulation for planar graphs","volume":"1","author":"Lee","year":"1986","journal-title":"Discrete Comp. Geom."},{"issue":"4","key":"10.1016\/1049-9652(92)90076-A_BIB25","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1093\/comjnl\/21.4.324","article-title":"Triangulation of planar regions with applications","volume":"21","author":"Lewis","year":"1979","journal-title":"Comput. J."},{"key":"10.1016\/1049-9652(92)90076-A_BIB26","series-title":"Proceedings, IEEE 18th Annual Symposium on the Foundations of Computer Science","first-page":"228","article-title":"On triangulations on a set of points in the plane","author":"Lloyd","year":"1977"},{"issue":"2","key":"10.1016\/1049-9652(92)90076-A_BIB27","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1093\/comjnl\/19.2.178","article-title":"Two-dimensional interpolation from random data","volume":"19","author":"McLain","year":"1976","journal-title":"Comput. J."},{"key":"10.1016\/1049-9652(92)90076-A_BIB28","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1016\/0146-664X(75)90005-2","article-title":"Detection of surface-specific points by local parallel processing of discrete terrain elevation data","volume":"4","author":"Peucker","year":"1975","journal-title":"Comput. Graphics Image Process."},{"key":"10.1016\/1049-9652(92)90076-A_BIB29","author":"Preparata","year":"1985"},{"issue":"2","key":"10.1016\/1049-9652(92)90076-A_BIB30","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1145\/356924.356930","article-title":"The quadtree and related hierarchical data structures","volume":"16","author":"Samet","year":"1984","journal-title":"Comput. Surveys"},{"key":"10.1016\/1049-9652(92)90076-A_BIB31","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1002\/nme.1620290105","article-title":"A combined octree\/Delaunay method for fully automatic 3-D mesh generation","volume":"29","author":"Schroeder","year":"1990","journal-title":"Internat. J. Numer. Methods Engrg."},{"key":"10.1016\/1049-9652(92)90076-A_BIB32","series-title":"Proceedings, Third ACM Symposium on Computational Geometry","first-page":"223","article-title":"An optimal algorithm for constructing the Delaunay triangulation of a set of line segments","author":"Wang","year":"1987"},{"key":"10.1016\/1049-9652(92)90076-A_BIB33","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1093\/comjnl\/24.2.167","article-title":"Computing the N-dimensional Delaunay tesselation with application to Voronoi polytopes","volume":"24","author":"Watson","year":"1981","journal-title":"Comput. J."}],"container-title":["CVGIP: Graphical Models and Image Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:104996529290076A?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:104996529290076A?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,6]],"date-time":"2019-02-06T08:55:48Z","timestamp":1549443348000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/104996529290076A"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,7]]},"references-count":33,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1992,7]]}},"alternative-id":["104996529290076A"],"URL":"https:\/\/doi.org\/10.1016\/1049-9652(92)90076-a","relation":{},"ISSN":["1049-9652"],"issn-type":[{"value":"1049-9652","type":"print"}],"subject":[],"published":{"date-parts":[[1992,7]]}}}