{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T20:46:56Z","timestamp":1761511616462},"reference-count":23,"publisher":"Elsevier BV","issue":"5-6","license":[{"start":{"date-parts":[[1997,4,1]],"date-time":"1997-04-01T00:00:00Z","timestamp":859852800000},"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":5951,"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":[[1997,4]]},"DOI":"10.1016\/s0925-7721(96)00024-7","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:19:33Z","timestamp":1049735973000},"page":"327-342","source":"Crossref","is-referenced-by-count":76,"title":["Strategies for polyhedral surface decomposition: An experimental study"],"prefix":"10.1016","volume":"7","author":[{"given":"Bernard","family":"Chazelle","sequence":"first","affiliation":[]},{"given":"David P.","family":"Dobkin","sequence":"additional","affiliation":[]},{"given":"Nadia","family":"Shouraboura","sequence":"additional","affiliation":[]},{"given":"Ayellet","family":"Tal","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0925-7721(96)00024-7_BIB1","series-title":"Proc. 11th Ann. ACM Sympos. Comput. Geom.","first-page":"C12","article-title":"Geomview: A system for geometric visualization","author":"Amenta","year":"1995"},{"key":"10.1016\/S0925-7721(96)00024-7_BIB2","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/BF02123007","article-title":"Triangles in space or building (and analyzing) castles in the air","volume":"10","author":"Aronov","year":"1990","journal-title":"Combinatorica"},{"key":"10.1016\/S0925-7721(96)00024-7_BIB3","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/BF02574371","article-title":"Castles in the air revisited","volume":"12","author":"Aronov","year":"1994","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0925-7721(96)00024-7_BIB4","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\/S0925-7721(96)00024-7_BIB5","series-title":"Proc. 9th Ann. ACM Sympos. Comput. Geom.","first-page":"281","article-title":"Compatible tetrahedralizations","author":"Bern","year":"1993"},{"key":"10.1016\/S0925-7721(96)00024-7_BIB6","series-title":"Computing in Euclidean Geometry I","first-page":"23","article-title":"Mesh generation and optimal triangulation","author":"Bern","year":"1992"},{"key":"10.1016\/S0925-7721(96)00024-7_BIB7","series-title":"Proc. 31st Ann. IEEE Sympos. Found. Comput. Sci.","first-page":"231","article-title":"Provably good mesh generation","author":"Bern","year":"1990"},{"key":"10.1016\/S0925-7721(96)00024-7_BIB8","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\/S0925-7721(96)00024-7_BIB9","series-title":"Proc. 11th Ann. ACM Sympos. Comput. Geom.","first-page":"V9","article-title":"Convex surface decomposition","author":"Chazelle","year":"1995"},{"key":"10.1016\/S0925-7721(96)00024-7_BIB10","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\/S0925-7721(96)00024-7_BIB11","series-title":"Proc. 3rd Scandinavian Workshop on Algorithm Theory","first-page":"364","article-title":"Decomposing the boundary of a nonconvex polytope","author":"Chazelle","year":"1992"},{"key":"10.1016\/S0925-7721(96)00024-7_BIB12","series-title":"Algebraic Geometry and its Applications","first-page":"419","article-title":"Decomposition algorithms in geometry","author":"Chazelle","year":"1994"},{"key":"10.1016\/S0925-7721(96)00024-7_BIB13","series-title":"Proc. 10th Ann. ACM Sympos. Comput. Geom.","first-page":"231","article-title":"Bounds on the size of tetrahedralizations","author":"Chazelle","year":"1994"},{"key":"10.1016\/S0925-7721(96)00024-7_BIB14","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0304-3975(82)90120-7","article-title":"Fast detection of polyhedral intersection","volume":"27","author":"Dobkin","year":"1983","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/S0925-7721(96)00024-7_BIB15_1","doi-asserted-by":"crossref","unstructured":"H. Fuchs, Z.M. Kedem and B. Naylor, On visible surface generation by a priori tree structure, in: Proc. SIGGRAPH '80","DOI":"10.1145\/800250.807481"},{"key":"10.1016\/S0925-7721(96)00024-7_BIB15_2","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1145\/965105.807481","volume":"14","year":"1980","journal-title":"Comput. Graph."},{"key":"10.1016\/S0925-7721(96)00024-7_BIB16","series-title":"Proc. 8th Ann. ACM Sympos. Comput. Geom.","first-page":"212","article-title":"Quality mesh generation in three dimensions","author":"Mitchell","year":"1992"},{"key":"10.1016\/S0925-7721(96)00024-7_BIB17","series-title":"Art Gallery Theorems and Algorithms","author":"O'Rourke","year":"1987"},{"key":"10.1016\/S0925-7721(96)00024-7_BIB18","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/BF02187840","article-title":"On the difficulty of triangulating three-dimensional non-convex polyhedra","volume":"7","author":"Ruppert","year":"1992","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0925-7721(96)00024-7_BIB19","series-title":"Proc. SIGGRAPH '93","first-page":"163","article-title":"On the form factor between two polygons","author":"Schr\u00f6der","year":"1993"},{"key":"10.1016\/S0925-7721(96)00024-7_BIB20_1","doi-asserted-by":"crossref","unstructured":"J.M. Snyder, A.R. Woodbury, K. Fleischer, B. Currin and A.H. Barr, Interval methods for multi-point collisions between time-dependent curved surfaces, in: Proc. SIGGRAPH '93","DOI":"10.1145\/166117.166158"},{"key":"10.1016\/S0925-7721(96)00024-7_BIB20_2","first-page":"321","volume":"27","year":"1993","journal-title":"Comput. Graph."},{"key":"10.1016\/S0925-7721(96)00024-7_BIB21","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1109\/2945.468401","article-title":"Visualization of geometric algorithms","volume":"1","author":"Tal","year":"1995","journal-title":"IEEE Trans. Visual. Comput. Graphics"}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772196000247?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772196000247?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T03:25:17Z","timestamp":1555212317000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0925772196000247"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,4]]},"references-count":23,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[1997,4]]}},"alternative-id":["S0925772196000247"],"URL":"https:\/\/doi.org\/10.1016\/s0925-7721(96)00024-7","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[1997,4]]}}}