{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,25]],"date-time":"2024-05-25T05:08:01Z","timestamp":1716613681431},"reference-count":22,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1992,12,1]],"date-time":"1992-12-01T00:00:00Z","timestamp":723168000000},"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":["Computer Aided Geometric Design"],"published-print":{"date-parts":[[1992,12]]},"DOI":"10.1016\/0167-8396(92)90044-p","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:41:40Z","timestamp":1027640500000},"page":"457-470","source":"Crossref","is-referenced-by-count":26,"title":["Delaunay triangulations in three dimensions with finite precision arithmetic"],"prefix":"10.1016","volume":"9","author":[{"given":"Tamal K.","family":"Dey","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kokichi","family":"Sugihara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chandrajit L.","family":"Bajaj","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/0167-8396(92)90044-P_BIB1","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1142\/S0218195992000068","article-title":"On good triangulations in three dimensions","volume":"2","author":"Dey","year":"1992","journal-title":"Intl. J. Comput. Geom. Appl."},{"key":"10.1016\/0167-8396(92)90044-P_BIB2","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1145\/73393.73404","article-title":"Recipes for geometry and numerical analysis","author":"Dobkin","year":"1988","journal-title":"Proc. Fourth ACM Symposium on Computational Geometry"},{"key":"10.1016\/0167-8396(92)90044-P_BIB3","series-title":"Algorithms in Combinatorial Geometry","author":"Edelsbrunner","year":"1987"},{"key":"10.1016\/0167-8396(92)90044-P_BIB4","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1145\/77635.77639","article-title":"Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms","volume":"9","author":"Edelsbrunner","year":"1990","journal-title":"ACM Trans. Comput. Graphs."},{"key":"10.1016\/0167-8396(92)90044-P_BIB5","series-title":"Proc. 30th IEEE Symposium on the Foundations of Computer Science","first-page":"494","article-title":"Stable maintenance of point-set triangulations in two dimensions","author":"Fortune","year":"1989"},{"key":"10.1016\/0167-8396(92)90044-P_BIB6","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1145\/142675.142695","article-title":"Numerical stability of algorithms for 2D Delaunay triangulations","author":"Fortune","year":"1992","journal-title":"Proc. Eigth ACM Symposium on Computational Geometry"},{"key":"10.1016\/0167-8396(92)90044-P_BIB7","first-page":"93","article-title":"Numerical stability of algorithms for line arrangements","author":"Fortune","year":"1991","journal-title":"Proc. Seventh ACM Symposium on Computational Geometry"},{"key":"10.1016\/0167-8396(92)90044-P_BIB8","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1145\/282918.282923","article-title":"Primitives for the manipulation of general dubdivisions and the computation of Voronoi diagrams","volume":"4","author":"Guibas","year":"1985","journal-title":"ACM Trans. Graphics"},{"key":"10.1016\/0167-8396(92)90044-P_BIB9","series-title":"Proc. Fifth ACM Symposium on Computational Geometry","first-page":"208","article-title":"Epsilon geometry: building robust algorithms from imprecise computations","author":"Guibas","year":"1989"},{"key":"10.1016\/0167-8396(92)90044-P_BIB10","series-title":"Topological Graph Theory","author":"Gross","year":"1987"},{"key":"10.1016\/0167-8396(92)90044-P_BIB11","series-title":"Technical Report","first-page":"87","article-title":"Robust set operations on polyhedral solids","author":"Hoffmann","year":"1987"},{"key":"10.1016\/0167-8396(92)90044-P_BIB12","series-title":"Computer Science Tech. Report","first-page":"89","article-title":"A paradigm for robust geometric algorithms","author":"Hopcroft","year":"1989"},{"key":"10.1016\/0167-8396(92)90044-P_BIB13","series-title":"Ph.D. Thesis","article-title":"On the Representation and Manipulation of Rigid Solids","author":"Karasick","year":"1988"},{"key":"10.1016\/0167-8396(92)90044-P_BIB14","first-page":"44","article-title":"Constructing strongly convex hulls using exact or rounded arithmetic","author":"Li","year":"1990","journal-title":"Proc. Sixth ACM Symposium on Computational Geometry"},{"key":"10.1016\/0167-8396(92)90044-P_BIB15","series-title":"Algebraic Topology","author":"Massey","year":"1967"},{"key":"10.1016\/0167-8396(92)90044-P_BIB16","series-title":"Ph.D. Thesis","article-title":"Verifiable Implementations of Geometric Algorithms Using Finite Precision Arithmetic","author":"Milenkovic","year":"1988"},{"key":"10.1016\/0167-8396(92)90044-P_BIB17","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1145\/323233.323238","article-title":"Consistent calculations for solids modeling","author":"Segal","year":"1985","journal-title":"Proc. First ACM Symposium on Computational Geometry"},{"key":"10.1016\/0167-8396(92)90044-P_BIB18","series-title":"Research Memorandum RMI 89-05","article-title":"Construction of the Voronoi diagram for one million generators in single-precision arithmetic","author":"Sugihara","year":"1989"},{"issue":"4","key":"10.1016\/0167-8396(92)90044-P_BIB19","first-page":"380","article-title":"A solid modelling system free from topological inconsistency","volume":"12","author":"Sugihara","year":"1989","journal-title":"J. Inform. Process."},{"key":"10.1016\/0167-8396(92)90044-P_BIB20","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1093\/comjnl\/24.2.167","article-title":"Computing the n-dimensional tesselation with applications to Voronoi polytopes","volume":"24","author":"Watson","year":"1981","journal-title":"Computer J."},{"key":"10.1016\/0167-8396(92)90044-P_BIB21","doi-asserted-by":"crossref","first-page":"150","DOI":"10.2307\/2371086","article-title":"Congruent graphs and the connectivity of graphs","volume":"54","author":"Whitney","year":"1932","journal-title":"Amer. J. Math."},{"key":"10.1016\/0167-8396(92)90044-P_BIB22","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1145\/73393.73407","article-title":"A geometric consistency theorem for a symbolic perturbation theorem","author":"Yap","year":"1988","journal-title":"Proc. Fourth ACM Symposium on Computational Geometry"}],"container-title":["Computer Aided Geometric Design"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016783969290044P?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016783969290044P?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:20:33Z","timestamp":1555125633000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016783969290044P"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,12]]},"references-count":22,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1992,12]]}},"alternative-id":["016783969290044P"],"URL":"https:\/\/doi.org\/10.1016\/0167-8396(92)90044-p","relation":{},"ISSN":["0167-8396"],"issn-type":[{"value":"0167-8396","type":"print"}],"subject":[],"published":{"date-parts":[[1992,12]]}}}