{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,16]],"date-time":"2026-05-16T11:33:38Z","timestamp":1778931218762,"version":"3.51.4"},"reference-count":8,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1997,3,1]],"date-time":"1997-03-01T00:00:00Z","timestamp":857174400000},"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":["Computers & Graphics"],"published-print":{"date-parts":[[1997,3]]},"DOI":"10.1016\/s0097-8493(96)00085-4","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T02:59:16Z","timestamp":1027652356000},"page":"215-223","source":"Crossref","is-referenced-by-count":61,"title":["An improved incremental algorithm for constructing restricted Delaunay triangulations"],"prefix":"10.1016","volume":"21","author":[{"given":"Marc Vigo","family":"Anglada","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0097-8493(96)00085-4_BIB1","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1093\/comjnl\/21.2.168","article-title":"Computing Dirichelet tessellations in the plane","volume":"21","author":"Green","year":"1978","journal-title":"The Computer Journal"},{"key":"10.1016\/S0097-8493(96)00085-4_BIB2","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1093\/comjnl\/24.2.162","article-title":"Computing Dirichelet tessellations","volume":"24","author":"Bowyer","year":"1981","journal-title":"The Computer Journal"},{"key":"10.1016\/S0097-8493(96)00085-4_BIB3","author":"Preparata","year":"1985"},{"key":"10.1016\/S0097-8493(96)00085-4_BIB4","first-page":"290","article-title":"An on-line algorithm for constrained delaunay triangulation","volume":"54","author":"de Floriani","year":"1992","journal-title":"Computer Vision, Graphics and Image Processing"},{"key":"10.1016\/S0097-8493(96)00085-4_BIB5","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF01553881","article-title":"Constrained Delaunay triangulations","volume":"4","author":"Chew","year":"1989","journal-title":"Algorithmica"},{"key":"10.1016\/S0097-8493(96)00085-4_BIB6","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 Computational Geometry"},{"key":"10.1016\/S0097-8493(96)00085-4_BIB7","series-title":"Mathematical Software III","first-page":"161","article-title":"Software for C1 surface interpolation","author":"Lawson","year":"1977"},{"issue":"1","key":"10.1016\/S0097-8493(96)00085-4_BIB8","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1016\/0141-1195(87)90043-X","article-title":"A fast algorithm for constructing Delaunay triangulations in the plane","volume":"9","author":"Sloan","year":"1987","journal-title":"Advances in Engineering Software"}],"container-title":["Computers & Graphics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0097849396000854?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0097849396000854?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T01:52:28Z","timestamp":1555206748000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0097849396000854"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,3]]},"references-count":8,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1997,3]]}},"alternative-id":["S0097849396000854"],"URL":"https:\/\/doi.org\/10.1016\/s0097-8493(96)00085-4","relation":{},"ISSN":["0097-8493"],"issn-type":[{"value":"0097-8493","type":"print"}],"subject":[],"published":{"date-parts":[[1997,3]]}}}