{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T23:24:49Z","timestamp":1783639489019,"version":"3.55.0"},"reference-count":27,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2018,10,1]],"date-time":"2018-10-01T00:00:00Z","timestamp":1538352000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computer-Aided Design"],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.1016\/j.cad.2017.11.009","type":"journal-article","created":{"date-parts":[[2017,12,19]],"date-time":"2017-12-19T08:09:32Z","timestamp":1513670972000},"page":"92-102","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":3,"special_numbering":"C","title":["Generalised Bagemihl polyhedra and a tight bound on the number of interior Steiner points"],"prefix":"10.1016","volume":"103","author":[{"given":"Hang","family":"Si","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nadja","family":"Goerigk","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"1\/4","key":"10.1016\/j.cad.2017.11.009_b1","doi-asserted-by":"crossref","first-page":"37","DOI":"10.2307\/2369986","article-title":"Theorems on the simple finite polygon and polyhedron","volume":"33","author":"Lennes","year":"1911","journal-title":"Amer J Math"},{"key":"10.1016\/j.cad.2017.11.009_b2","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 Ann"},{"issue":"7","key":"10.1016\/j.cad.2017.11.009_b3","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1080\/00029890.1948.11999266","article-title":"On indecomposable polyhedra","volume":"55","author":"Bagemihl","year":"1948","journal-title":"Amer Math Monthly"},{"issue":"2\/3","key":"10.1016\/j.cad.2017.11.009_b4","first-page":"90","article-title":"Orthogonal icosahedra","volume":"15","author":"Jessen","year":"1967","journal-title":"Nord Mat Tidskr"},{"key":"10.1016\/j.cad.2017.11.009_b5","series-title":"Combinatorial and computational geometry, Vol. 52","first-page":"501","article-title":"On a generalization of Sch\u00f6nhardt\u2019s polyhedron","author":"Rambau","year":"2005"},{"issue":"1","key":"10.1016\/j.cad.2017.11.009_b6","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/s13366-015-0248-4","article-title":"On nontriangulable polyhedra","volume":"57","author":"Bezdek","year":"2016","journal-title":"Beitr\u00e4ge Algebra Geom"},{"key":"10.1016\/j.cad.2017.11.009_b7","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\/j.cad.2017.11.009_b8","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/S0196-6774(03)00092-0","article-title":"The complexity of finding small triangulations of convex 3-polytopes","volume":"50","author":"Below","year":"2004","journal-title":"J Algorithms"},{"key":"10.1016\/j.cad.2017.11.009_b9","series-title":"Triangulations, structures for algorithms and applications","volume":"vol. 25","author":"De Loera","year":"2010"},{"key":"10.1016\/j.cad.2017.11.009_b10","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/0045-7825(91)90017-Z","article-title":"Automatic mesh generator with specified boundary","volume":"92","author":"George","year":"1991","journal-title":"Comput Methods Appl Mech Engrg"},{"key":"10.1016\/j.cad.2017.11.009_b11","doi-asserted-by":"crossref","first-page":"2005","DOI":"10.1002\/nme.1620371203","article-title":"Efficient three-dimensional Delaunay triangulation with automatic point creation and imposed boundary constraints","volume":"37","author":"Weatherill","year":"1994","journal-title":"Internat J Numer Methods Engrg"},{"key":"10.1016\/j.cad.2017.11.009_b12","doi-asserted-by":"crossref","first-page":"1061","DOI":"10.1002\/nme.808","article-title":"\u201cUltimate\u201d robustness in meshing an arbitrary polyhedron","volume":"58","author":"George","year":"2003","journal-title":"Internat J Numer Methods Engrg"},{"issue":"2","key":"10.1016\/j.cad.2017.11.009_b13","doi-asserted-by":"crossref","first-page":"11:1","DOI":"10.1145\/2629697","article-title":"TetGen, a Delaunay-based quality tetrahedral mesh generator","volume":"41","author":"Si","year":"2015","journal-title":"ACM Trans Math Software"},{"issue":"1","key":"10.1016\/j.cad.2017.11.009_b14","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1007\/BF02187806","article-title":"Efficient binary space partitions for hidden-surface removal and solid modeling","volume":"5","author":"Paterson","year":"1990","journal-title":"Discrete Comput Geom"},{"issue":"3","key":"10.1016\/j.cad.2017.11.009_b15","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1137\/0213031","article-title":"Convex partition of polyhedra: a lower bound and worst-case optimal algorithm","volume":"13","author":"Chazelle","year":"1984","journal-title":"SIAM J Comput"},{"issue":"1\u20132","key":"10.1016\/j.cad.2017.11.009_b16","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/j.comgeo.2004.08.004","article-title":"Local polyhedra and geometric graphs","volume":"31","author":"Erickson","year":"2005","journal-title":"Comput Geom"},{"issue":"2","key":"10.1016\/j.cad.2017.11.009_b17","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/j.comgeo.2009.04.003","article-title":"Decompositions and boundary coverings of non-convex fat polyhedra","volume":"43","author":"de\u00a0Berg","year":"2010","journal-title":"Comput. Geom."},{"key":"10.1016\/j.cad.2017.11.009_b18","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1137\/0222036","article-title":"An upper bound for conforming Delaunay triangulations","volume":"22","author":"Edelsbrunner","year":"1993","journal-title":"SIAM J Comput"},{"key":"10.1016\/j.cad.2017.11.009_b19","doi-asserted-by":"crossref","unstructured":"Murphy M, Mount DM, Gable CW. A point-placement strategy for conforming Delaunay tetrahedralizations. In: Proc. 11th annual ACM-SIAM symposium on discrete algorithms. 2000. p. 69\u201393.","DOI":"10.1142\/S0218195901000699"},{"key":"10.1016\/j.cad.2017.11.009_b20","doi-asserted-by":"crossref","unstructured":"Cohen-Steiner D, De\u00a0Verdi\u00e8re \u00c9\u00a0C, Yvinec M. Conforming Delaunay triangulation in 3D. In: Proc. 18th ann. symp. on comput. geom. 2002.","DOI":"10.1145\/513400.513425"},{"key":"10.1016\/j.cad.2017.11.009_b21","unstructured":"Miller GL, Talmor D, Teng S-H, Walkington NJ, Wang H. Control volume meshes using sphere packing: generation, refinement and coarsening. In: Proc. 5th intl. meshing roundtable. 1996."},{"issue":"1","key":"10.1016\/j.cad.2017.11.009_b22","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/s00454-016-9772-8","article-title":"Nonobtuse triangulations of PSLGs","volume":"56","author":"Bishop","year":"2016","journal-title":"Discrete Comput Geom"},{"key":"10.1016\/j.cad.2017.11.009_b23","series-title":"Handbook of grid generation","year":"1998"},{"key":"10.1016\/j.cad.2017.11.009_b24","series-title":"Mesh generation - application to finite elements","isbn-type":"print","first-page":"814","author":"Frey","year":"2000","ISBN":"https:\/\/id.crossref.org\/isbn\/1903398002"},{"issue":"3","key":"10.1016\/j.cad.2017.11.009_b25","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/BF02771695","article-title":"Indecomposable convex polytopes","volume":"58","author":"McMullen","year":"1987","journal-title":"Israel J Math"},{"issue":"5\u20136","key":"10.1016\/j.cad.2017.11.009_b26","doi-asserted-by":"crossref","first-page":"715","DOI":"10.1080\/02331930701617304","article-title":"Some indecomposable polyhedra","volume":"56","author":"Yost","year":"2007","journal-title":"Optimization"},{"key":"10.1016\/j.cad.2017.11.009_b27","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/j.proeng.2015.10.144","article-title":"On indecomposable polyhedra and the number of Steiner points","volume":"124","author":"Goerigk","year":"2015","journal-title":"Procedia Eng"}],"container-title":["Computer-Aided Design"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0010448517302324?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0010448517302324?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,6,5]],"date-time":"2019-06-05T12:42:40Z","timestamp":1559738560000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0010448517302324"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10]]},"references-count":27,"alternative-id":["S0010448517302324"],"URL":"https:\/\/doi.org\/10.1016\/j.cad.2017.11.009","relation":{},"ISSN":["0010-4485"],"issn-type":[{"value":"0010-4485","type":"print"}],"subject":[],"published":{"date-parts":[[2018,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Generalised Bagemihl polyhedra and a tight bound on the number of interior Steiner points","name":"articletitle","label":"Article Title"},{"value":"Computer-Aided Design","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cad.2017.11.009","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2017 Elsevier Ltd. All rights reserved.","name":"copyright","label":"Copyright"}]}}