{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T16:06:18Z","timestamp":1764173178209},"reference-count":25,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1993,9,1]],"date-time":"1993-09-01T00:00:00Z","timestamp":746841600000},"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":[[1993,9]]},"DOI":"10.1016\/0097-8493(93)90007-v","type":"journal-article","created":{"date-parts":[[2003,8,7]],"date-time":"2003-08-07T23:49:30Z","timestamp":1060300170000},"page":"563-574","source":"Crossref","is-referenced-by-count":13,"title":["Algorithm and data structure for triangulating multiply connected polygonal domains"],"prefix":"10.1016","volume":"17","author":[{"given":"Les A.","family":"Piegl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arnaud M.","family":"Richard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0097-8493(93)90007-V_BIB1","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1145\/74334.74344","article-title":"Real-time rendering of trimmed surfaces","volume":"23","author":"Rockwood","year":"1989","journal-title":"Comp. Graph."},{"key":"10.1016\/0097-8493(93)90007-V_BIB2","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1016\/0010-4485(92)90011-X","article-title":"Triangulation of trimmed surfaces in parametric space","volume":"24","author":"Sheng","year":"1992","journal-title":"Computer-Aided Des."},{"key":"10.1016\/0097-8493(93)90007-V_BIB3","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1145\/142920.134019","article-title":"Three dimensional apparel CAD system","volume":"26","author":"Okabe","year":"1992","journal-title":"Comp. Graph."},{"key":"10.1016\/0097-8493(93)90007-V_BIB4","first-page":"127","article-title":"Delaunay based representation of surfaces defined over arbitrary shaped domains","volume":"32","author":"DeFloriani","year":"1985"},{"key":"10.1016\/0097-8493(93)90007-V_BIB5","first-page":"1","article-title":"Shape reconstruction from planar cross sections","volume":"44","author":"Boissonnat","year":"1988"},{"key":"10.1016\/0097-8493(93)90007-V_BIB6","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0097-8493(91)90028-G","article-title":"Smooth surface reconstruction from scattered data points","volume":"15","author":"Agishtein","year":"1991","journal-title":"Comp. Graph."},{"key":"10.1016\/0097-8493(93)90007-V_BIB7","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1115\/1.3151889","article-title":"Approaches to the automatic finite element generation and control of finite element meshes","volume":"41","author":"Shephard","year":"1988","journal-title":"Appl. Mech. Rev."},{"key":"10.1016\/0097-8493(93)90007-V_BIB8","doi-asserted-by":"crossref","unstructured":"K. Ho-Le, Finite element mesh generation methods: a review and classification. Computer-Aided Des.20, 27\u201338.","DOI":"10.1016\/0010-4485(88)90138-8"},{"key":"10.1016\/0097-8493(93)90007-V_BIB9","article-title":"Fast planar mesh generation using the Delaunay triangulation","author":"Frey","year":"1983","journal-title":"General Motors Res. Publ. GMR-4555"},{"key":"10.1016\/0097-8493(93)90007-V_BIB10","series-title":"Computational Geometry\u2014An Introduction","author":"Preparata","year":"1985"},{"key":"10.1016\/0097-8493(93)90007-V_BIB11","series-title":"Algorithms in Combinatorial Geometry","author":"Edelsbrunner","year":"1987"},{"key":"10.1016\/0097-8493(93)90007-V_BIB12","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 and Comp. Geometry"},{"key":"10.1016\/0097-8493(93)90007-V_BIB13","doi-asserted-by":"crossref","first-page":"1403","DOI":"10.1002\/nme.1620210805","article-title":"A new mesh generation scheme for arbitrary planar domains","volume":"21","author":"Lo","year":"1985","journal-title":"Int. J. Num. Meth. Eng."},{"key":"10.1016\/0097-8493(93)90007-V_BIB14","doi-asserted-by":"crossref","first-page":"679","DOI":"10.1002\/nme.1620080402","article-title":"Automatic triangulation of arbitrary planar domains for the finite element method","volume":"8","author":"Cavendish","year":"1974","journal-title":"Int. J. Num. Meth. Eng."},{"key":"10.1016\/0097-8493(93)90007-V_BIB15","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1093\/comjnl\/21.4.324","article-title":"Triangulation of planar regions with applications","volume":"21","author":"Lewis","year":"1978","journal-title":"Comp. J."},{"key":"10.1016\/0097-8493(93)90007-V_BIB16","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/0307-904X(78)90002-1","article-title":"A triangulation algorithm for arbitrary planar domains","volume":"2","author":"Nelson","year":"1978","journal-title":"Appl. Math. Mod."},{"key":"10.1016\/0097-8493(93)90007-V_BIB17","first-page":"175","article-title":"Triangulation of a simple polygon","volume":"7","author":"Garey","year":"1978"},{"key":"10.1016\/0097-8493(93)90007-V_BIB18","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1147\/rd.313.0361","article-title":"Voronoi diagram for multiply-connected polygonal domains I: Algorithm","volume":"31","author":"Srinivasan","year":"1987","journal-title":"IBM J. Res. Dev."},{"key":"10.1016\/0097-8493(93)90007-V_BIB19","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1147\/rd.313.0373","article-title":"Voronoi diagram for multiply-connected polygonal domains II: Implementation and application","volume":"31","author":"Srinivasan","year":"1987","journal-title":"IBM J. Res. Dev."},{"key":"10.1016\/0097-8493(93)90007-V_BIB20","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1016\/0167-8396(91)90028-A","article-title":"Delaunay triangulation of arbitrary shaped planar domains","volume":"8","author":"Sapidis","year":"1991","journal-title":"Computer-Aided Geometric Des."},{"key":"10.1016\/0097-8493(93)90007-V_BIB21","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1109\/MCG.1983.262997","article-title":"Finite element mesh generation based on a modified-quadtree approach","volume":"3","author":"Yerry","year":"1986","journal-title":"IEEE Comp. Graph. Appl."},{"key":"10.1016\/0097-8493(93)90007-V_BIB22","doi-asserted-by":"crossref","first-page":"1043","DOI":"10.1002\/nme.1620240603","article-title":"Robust, geometrically based, automatic two-dimensional mesh generation","volume":"24","author":"Baehmann","year":"1987","journal-title":"Int. J. Num. Meth. Eng."},{"key":"10.1016\/0097-8493(93)90007-V_BIB23","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/BF02274211","article-title":"An \u03b8(n) algorithm to automatically generate geometric triangulations satisfying the Delaunay circumsphere criteria","volume":"5","author":"Schroeder","year":"1989","journal-title":"Eng. Comp."},{"key":"10.1016\/0097-8493(93)90007-V_BIB24","doi-asserted-by":"crossref","first-page":"1305","DOI":"10.1137\/0727074","article-title":"A constrained two-dimensional triangulation and the solution of closest node problems in the presence of barriers","volume":"27","author":"Cline","year":"1990","journal-title":"SIAM J. Num. Anal."},{"key":"10.1016\/0097-8493(93)90007-V_BIB25","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1109\/38.210490","article-title":"Delaunay triangulation using a uniform grid","author":"Fang","year":"1993","journal-title":"IEEE Comp. Graph. Appl."}],"container-title":["Computers & Graphics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:009784939390007V?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:009784939390007V?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,25]],"date-time":"2020-03-25T05:06:36Z","timestamp":1585112796000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/009784939390007V"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,9]]},"references-count":25,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1993,9]]}},"alternative-id":["009784939390007V"],"URL":"https:\/\/doi.org\/10.1016\/0097-8493(93)90007-v","relation":{},"ISSN":["0097-8493"],"issn-type":[{"value":"0097-8493","type":"print"}],"subject":[],"published":{"date-parts":[[1993,9]]}}}