{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T19:13:52Z","timestamp":1774638832799,"version":"3.50.1"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[1989,6,1]],"date-time":"1989-06-01T00:00:00Z","timestamp":612662400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1989,6]]},"DOI":"10.1007\/bf01553881","type":"journal-article","created":{"date-parts":[[2005,4,20]],"date-time":"2005-04-20T22:07:35Z","timestamp":1114034855000},"page":"97-108","source":"Crossref","is-referenced-by-count":501,"title":["Constrained delaunay triangulations"],"prefix":"10.1007","volume":"4","author":[{"given":"L.","family":"Paul Chew","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF01553881_CR1","doi-asserted-by":"crossref","unstructured":"L. P. Chew and R. L. Drysdale, Voronoi diagrams based on convex distance functions,Proceedings of the First Symposium on Computational Geometry, Baltimore (1985), pp. 235\u2013244. (Revised version submitted toDiscrete and Computational Geometry.)","DOI":"10.1145\/323233.323264"},{"key":"BF01553881_CR2","doi-asserted-by":"crossref","unstructured":"L. P. Chew, There is a planar graph almost as good as the complete graph,Proceedings of the Second Annual Symposium on Computational Geometry, Yorktown Heights (1986), pp. 169\u2013177.","DOI":"10.1145\/10515.10534"},{"key":"BF01553881_CR3","unstructured":"L. P. Chew, Planar graphs and sparse graphs for efficient motion planning in the plane, in preparation."},{"key":"BF01553881_CR4","unstructured":"L. P. Chew, Guaranteed-quality triangular meshes, in preparation."},{"key":"BF01553881_CR5","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0734-189X(85)90005-2","volume":"32","author":"L. Floriani De","year":"1985","unstructured":"L. De Floriani, B. Falcidieno, and C. Pienovi, Delaunay-based representation of surfaces defined over arbitrarily shaped domains,Computer Vision, Graphics, and Image Processing,32 (1985), 127\u2013140.","journal-title":"Computer Vision, Graphics, and Image Processing"},{"key":"BF01553881_CR6","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/BF01840357","volume":"2","author":"S. Fortune","year":"1987","unstructured":"S. Fortune, A Sweepline algorithm for Voronoi diagrams,Algorithmica,2 (1987), 153\u2013174.","journal-title":"Algorithmica"},{"key":"BF01553881_CR7","doi-asserted-by":"crossref","unstructured":"D. G. Kirkpatrick, Efficient computation of continuous skeletons,Proceedings of the 20th Annual Symposium on the Foundations of Computer Science, IEEE Computer Society (1979), pp. 18\u201327.","DOI":"10.1109\/SFCS.1979.15"},{"key":"BF01553881_CR8","unstructured":"D. T. Lee, Proximity and reachability in the plane, Technical Report R-831, Coordinated Science Laboratory, University of Illinois (1978)."},{"key":"BF01553881_CR9","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/BF02187695","volume":"1","author":"D. T. Lee","year":"1986","unstructured":"D. T. Lee and A. K. Lin, Generalized Delaunay triangulation for planar graphs,Discrete and Computational Geometry,1 (1986), 201\u2013217.","journal-title":"Discrete and Computational Geometry"},{"key":"BF01553881_CR10","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/BF00977785","volume":"9","author":"D. T. Lee","year":"1980","unstructured":"D. T. Lee and B. Schachter, Two algorithms for constructing Delaunay triangulations,International Journal of Computer and Information Sciences,9 (1980), 219\u2013242.","journal-title":"International Journal of Computer and Information Sciences"},{"key":"BF01553881_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry","author":"F. P. Preparata","year":"1985","unstructured":"F. P. Preparata and M. I. Shamos,Computational Geometry, Springer-Verlag, New York (1985)."},{"key":"BF01553881_CR12","unstructured":"C. K. Yap, AnO(n logn) algorithm for the Voronoi diagram of a set of simple curve segments. Technical Report, Courant Institute, New York University (October 1984)."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01553881.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01553881\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01553881","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T14:21:13Z","timestamp":1556893273000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01553881"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,6]]},"references-count":12,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[1989,6]]}},"alternative-id":["BF01553881"],"URL":"https:\/\/doi.org\/10.1007\/bf01553881","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,6]]}}}