{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T22:40:38Z","timestamp":1777502438714,"version":"3.51.4"},"reference-count":25,"publisher":"Elsevier BV","issue":"8","license":[{"start":{"date-parts":[[1992,8,1]],"date-time":"1992-08-01T00:00:00Z","timestamp":712627200000},"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 Design"],"published-print":{"date-parts":[[1992,8]]},"DOI":"10.1016\/0010-4485(92)90010-8","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T09:47:17Z","timestamp":1047635237000},"page":"425-436","source":"Crossref","is-referenced-by-count":35,"title":["Algorithm for Delaunay triangulation and convex-hull computation using a sparse matrix"],"prefix":"10.1016","volume":"24","author":[{"given":"T-P.","family":"Fang","sequence":"first","affiliation":[]},{"given":"L.A.","family":"Piegl","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0010-4485(92)90010-8_BIB1","first-page":"97","article-title":"Nouvelles applications des param\u00e8tres continus \u00e0 la th\u00e9orie des formes quadratiques. Premier m\u00e9moire: Sur quelques propriete\u00e9s des formes quadratiques positives parfaites","volume":"Vol 133","author":"Voronoi","year":"1907","journal-title":"J. Angew. Math."},{"key":"10.1016\/0010-4485(92)90010-8_BIB2","first-page":"167","article-title":"Nouvelles applications des param\u00e8tres continus \u00e0 la th\u00e9orie des formes quadratiques. Deuxi\u00e8me m\u00e9moire: Recherches sur les parall\u00e9llo\u00e8dres primitifs","volume":"Vol 134","author":"Voronoi","year":"1908","journal-title":"J. Angew. Math."},{"key":"10.1016\/0010-4485(92)90010-8_BIB3","first-page":"109","article-title":"Neue Darstellung der geometrischen Krystallographie","volume":"Vol 84","author":"Delaunay","year":"1932","journal-title":"Zeitschr. Krystallographie"},{"key":"10.1016\/0010-4485(92)90010-8_BIB4","first-page":"793","article-title":"Sur la sph\u00e8re vide","volume":"Vol 7","author":"Delaunay","year":"1934","journal-title":"Izv. Akad. Nauk SSSR Otdelenie Matemat. Eststvennyka Nauk"},{"key":"10.1016\/0010-4485(92)90010-8_BIB5","article-title":"Computational geometry","author":"Shamos","year":"1977"},{"key":"10.1016\/0010-4485(92)90010-8_BIB6","series-title":"Computational Geometry - An Introduction","author":"Preparata","year":"1985"},{"key":"10.1016\/0010-4485(92)90010-8_BIB7","series-title":"Algorithms in Combinatorial Geometry","author":"Edelsbrunner","year":"1987"},{"issue":"No 2","key":"10.1016\/0010-4485(92)90010-8_BIB8","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1111\/j.1538-4632.1973.tb01003.x","article-title":"Analytic delineation of Thiessen polygons","volume":"Vol 5","author":"Rhynsburger","year":"1973","journal-title":"Geograph. Anal."},{"issue":"No 2","key":"10.1016\/0010-4485(92)90010-8_BIB9","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1093\/comjnl\/21.2.168","article-title":"Computing Dirichlet tessellations in the plane","volume":"Vol 21","author":"Green","year":"1978","journal-title":"Comput. J."},{"issue":"No 3","key":"10.1016\/0010-4485(92)90010-8_BIB10","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1093\/comjnl\/21.3.243","article-title":"Locally equiangular triangulations","volume":"Vol 21","author":"Sibson","year":"1978","journal-title":"Comput. J."},{"issue":"No 4","key":"10.1016\/0010-4485(92)90010-8_BIB11","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1093\/comjnl\/21.4.324","article-title":"Triangulation of planar regions with applications","volume":"Vol 21","author":"Lewis","year":"1978","journal-title":"Comput. J."},{"issue":"No 2","key":"10.1016\/0010-4485(92)90010-8_BIB12","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1093\/comjnl\/24.2.162","article-title":"Computing Dirichlet tessellations","volume":"Vol 24","author":"Bowyer","year":"1981","journal-title":"Comput. J."},{"key":"10.1016\/0010-4485(92)90010-8_BIB13","article-title":"Triangulation and bivariate interpolation for irregularly distributed data points","author":"Renka","year":"1981"},{"issue":"No 1","key":"10.1016\/0010-4485(92)90010-8_BIB14","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1216\/RMJ-1984-14-1-119","article-title":"A storage efficient method for construction of a Thiessen triangulation","volume":"Vol 14","author":"Cline","year":"1984","journal-title":"Rocky Mountain J. Math."},{"key":"10.1016\/0010-4485(92)90010-8_BIB15","first-page":"223","article-title":"Voronoi diagrams from convex hulls","volume":"Vol 5","author":"Brown","year":"1979"},{"issue":"No 3","key":"10.1016\/0010-4485(92)90010-8_BIB16","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/BF00977785","article-title":"Two algorithms for constructing Delaunay triangulation","volume":"Vol 9","author":"Lee","year":"1980","journal-title":"Int. J. Comput. Inf. Sci."},{"issue":"No 2","key":"10.1016\/0010-4485(92)90010-8_BIB17","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1145\/282918.282923","article-title":"Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams","volume":"Vol 4","author":"Guibas","year":"1985","journal-title":"ACM Trans. Graph."},{"issue":"No 12","key":"10.1016\/0010-4485(92)90010-8_BIB18","doi-asserted-by":"crossref","first-page":"1072","DOI":"10.1109\/TC.1984.1676388","article-title":"Computational geometry - a survey","volume":"Vol C-33","author":"Lee","year":"1984","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0010-4485(92)90010-8_BIB19","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0032048","article-title":"Randomized incremental construction of Delaunay and Voronoi diagrams","author":"Guibas","year":"1990"},{"key":"10.1016\/0010-4485(92)90010-8_BIB20","series-title":"Techniques for Computer Graphics","article-title":"Computational geometry and software engineering: towards a geometric computing environment","author":"Forrest","year":"1987"},{"key":"10.1016\/0010-4485(92)90010-8_BIB21","series-title":"Algorithms in C","author":"Sedgewick","year":"1990"},{"key":"10.1016\/0010-4485(92)90010-8_BIB22","author":"Gonnet","year":"1991"},{"key":"10.1016\/0010-4485(92)90010-8_BIB23","series-title":"Data Structures Using C","author":"Tenenbaum","year":"1990"},{"key":"10.1016\/0010-4485(92)90010-8_BIB24","series-title":"Introduction to Algorithms","author":"Cormen","year":"1990"},{"key":"10.1016\/0010-4485(92)90010-8_BIB25","series-title":"Programs and Data Structures in C","author":"Ammeraal","year":"1987"}],"container-title":["Computer-Aided Design"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0010448592900108?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0010448592900108?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T16:23:50Z","timestamp":1553617430000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0010448592900108"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,8]]},"references-count":25,"journal-issue":{"issue":"8","published-print":{"date-parts":[[1992,8]]}},"alternative-id":["0010448592900108"],"URL":"https:\/\/doi.org\/10.1016\/0010-4485(92)90010-8","relation":{},"ISSN":["0010-4485"],"issn-type":[{"value":"0010-4485","type":"print"}],"subject":[],"published":{"date-parts":[[1992,8]]}}}