{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T22:43:10Z","timestamp":1649025790957},"reference-count":15,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1996,9,1]],"date-time":"1996-09-01T00:00:00Z","timestamp":841536000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6163,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Geometry"],"published-print":{"date-parts":[[1996,9]]},"DOI":"10.1016\/0925-7721(95)00011-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T10:53:54Z","timestamp":1027594434000},"page":"263-276","source":"Crossref","is-referenced-by-count":0,"title":["Optimal tetrahedralization of the 3D-region \u201cbetween\u201d a convex polyhedron and a convex polygon"],"prefix":"10.1016","volume":"6","author":[{"given":"Leonidas","family":"Palios","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0925-7721(95)00011-9_BIB1","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1137\/0221025","article-title":"Convex decompositions of polyhedra and robustness","volume":"21","author":"Bajaj","year":"1992","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0925-7721(95)00011-9_BIB2","series-title":"Proc. 1975 National Comput. Conf.","first-page":"589","article-title":"A polyhedron representation for computer vision","volume":"44","author":"Baumgart","year":"1975"},{"key":"10.1016\/0925-7721(95)00011-9_BIB3","series-title":"Proc. 9th ACM Symp. Comput. Geom.","first-page":"281","article-title":"Compatible tetrahedralizations","author":"Bern","year":"1993"},{"key":"10.1016\/0925-7721(95)00011-9_BIB4","unstructured":"M. Bern and D. Eppstein, Mesh generation and optimal triangulation, Xerox PARC Technical Report CSL-92-1."},{"key":"10.1016\/0925-7721(95)00011-9_BIB5","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1137\/0213031","article-title":"Convex partitions of polyhedra: a lower bound and worst-case optimal algorithm","volume":"13","author":"Chazelle","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0925-7721(95)00011-9_BIB6","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1007\/BF02187807","article-title":"Triangulating a nonconvex polytope","volume":"5","author":"Chazelle","year":"1990","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0925-7721(95)00011-9_BIB7","series-title":"Proc. 10th Annual ACM Symp. Comput. Geom.","first-page":"231","article-title":"Bounds on the size of tetrahedralizations","author":"Chazelle","year":"1994"},{"key":"10.1016\/0925-7721(95)00011-9_BIB8","series-title":"Algorithms in Combinatorial Geometry","author":"Edelsbrunner","year":"1987"},{"key":"10.1016\/0925-7721(95)00011-9_BIB9","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/BF02787218","article-title":"Cell decomposition of polytopes by bending","volume":"64","author":"Goodman","year":"1988","journal-title":"Israel J. Math."},{"key":"10.1016\/0925-7721(95)00011-9_BIB10","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1145\/282918.282923","article-title":"Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams","volume":"4","author":"Guibas","year":"1985","journal-title":"ACM Trans. Graphics"},{"key":"10.1016\/0925-7721(95)00011-9_BIB11","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0304-3975(78)90051-8","article-title":"Finding the intersection of two convex polyhedra","volume":"7","author":"Muller","year":"1978","journal-title":"Theor. Comp. Sci."},{"key":"10.1016\/0925-7721(95)00011-9_BIB12","series-title":"Computational Geometry, An Introduction","author":"Preparata","year":"1985"},{"key":"10.1016\/0925-7721(95)00011-9_BIB13","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/BF02187840","article-title":"On the difficulty of triangulating three-dimensional nonconvex polyhedra","volume":"7","author":"Ruppert","year":"1992","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0925-7721(95)00011-9_BIB14","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/BF01451597","article-title":"\u00dcber die Zerlegung von Dreieckspolyedern in Tetraeder","volume":"98","author":"Sch\u00f6nhardt","year":"1928","journal-title":"Math. Annalen"},{"key":"10.1016\/0925-7721(95)00011-9_BIB15","series-title":"Algorithms","author":"Sedgewick","year":"1988"}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0925772195000119?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0925772195000119?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T17:25:03Z","timestamp":1556385903000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0925772195000119"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,9]]},"references-count":15,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1996,9]]}},"alternative-id":["0925772195000119"],"URL":"https:\/\/doi.org\/10.1016\/0925-7721(95)00011-9","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[1996,9]]}}}