{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T04:20:10Z","timestamp":1778300410870,"version":"3.51.4"},"reference-count":0,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Comput. Geom. Appl."],"published-print":{"date-parts":[[1996,3]]},"abstract":"<jats:p> In this paper, we propose an algorithm to compute the Delaunay triangulation of a set [Formula: see text] of n points in 3-dimensional space when the points lie in 2 planes. The algorithm is output-sensitive and optimal with respect to the input and the output sizes. Its time complexity is O(n log n+t), where t is the size of the output, and the extra storage is O(n). <\/jats:p>","DOI":"10.1142\/s0218195996000022","type":"journal-article","created":{"date-parts":[[2004,9,6]],"date-time":"2004-09-06T07:50:09Z","timestamp":1094457009000},"page":"1-14","source":"Crossref","is-referenced-by-count":5,"title":["OUTPUT SENSITIVE CONSTRUCTION OF THE DELAUNAY TRIANGULATION OF POINTS LYING IN TWO PLANES"],"prefix":"10.1142","volume":"06","author":[{"given":"JEAN-DANIEL","family":"BOISSONNAT","sequence":"first","affiliation":[{"name":"INRIA, B.P. 93, 06902 Sophia-Antipolis cedex, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"ANDR\u00c9","family":"C\u00c9R\u00c9ZO","sequence":"additional","affiliation":[{"name":"Universit\u00e9 de Nice, Parc Valrose, 06034 Nice cedex, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"OLIVIER","family":"DEVILLERS","sequence":"additional","affiliation":[{"name":"INRIA, B.P. 93, 06902 Sophia-Antipolis cedex, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"MONIQUE","family":"TEILLAUD","sequence":"additional","affiliation":[{"name":"INRIA, B.P. 93, 06902 Sophia-Antipolis cedex, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"container-title":["International Journal of Computational Geometry &amp; Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218195996000022","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T20:31:19Z","timestamp":1565123479000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218195996000022"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,3]]},"references-count":0,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[1996,3]]}},"alternative-id":["10.1142\/S0218195996000022"],"URL":"https:\/\/doi.org\/10.1142\/s0218195996000022","relation":{},"ISSN":["0218-1959","1793-6357"],"issn-type":[{"value":"0218-1959","type":"print"},{"value":"1793-6357","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,3]]}}}