{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:01:48Z","timestamp":1725663708359},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540557067"},{"type":"electronic","value":"9783540472759"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-55706-7_34","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T10:33:27Z","timestamp":1330252407000},"page":"376-387","source":"Crossref","is-referenced-by-count":2,"title":["Convex polygons made from few lines and convex decompositions of polyhedra"],"prefix":"10.1007","author":[{"given":"John","family":"Hershberger","sequence":"first","affiliation":[]},{"given":"Jack","family":"Snoeyink","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"34_CR1","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1007\/BF02788872","volume":"7","author":"R. J. Canham","year":"1969","unstructured":"R. J. Canham. A theorem on arrangements of lines in the plane. Israel J. Math., 7:393\u2013397, 1969.","journal-title":"Israel J. Math."},{"issue":"3","key":"34_CR2","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1137\/0213031","volume":"13","author":"B. Chazelle","year":"1984","unstructured":"B. Chazelle. Convex partitions of polyhedra: A lower bound and worst-case optimal algorithm. SIAM J. Comp., 13(3):488\u2013507, 1984.","journal-title":"SIAM J. Comp."},{"key":"34_CR3","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1007\/BF01934990","volume":"25","author":"B. Chazelle","year":"1985","unstructured":"B. Chazelle, L. J. Guibas, and D. T. Lee. The power of geometric duality. BIT, 25:76\u201390, 1985.","journal-title":"BIT"},{"key":"34_CR4","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1007\/BF02187807","volume":"5","author":"B. Chazelle","year":"1990","unstructured":"B. Chazelle and L. Palios. Triangulating a nonconvex polytope. Disc. & Comp. Geom., 5:505\u2013526, 1990.","journal-title":"Disc. & Comp. Geom."},{"key":"34_CR5","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/BF02187783","volume":"5","author":"K. L. Clarkson","year":"1990","unstructured":"K. L. Clarkson, H. Edelsbrunner, L. Guibas, M. Sharir, and E. Welzl. Combinatorial complexity bounds for arrangements of curves and spheres. Disc. & Comp. Geom., 5:99\u2013160, 1990.","journal-title":"Disc. & Comp. Geom."},{"key":"34_CR6","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/BF02187740","volume":"4","author":"K. L. Clarkson","year":"1989","unstructured":"K. L. Clarkson and P. W. Shor. Applications of random sampling in computational geometry, II. Disc. & Comp. Geom., 4:387\u2013421, 1989.","journal-title":"Disc. & Comp. Geom."},{"doi-asserted-by":"crossref","unstructured":"T. K. Dey. Triangulation and CSG representation of polyhedra with arbitrary genus. In Proc. 7th Ann. ACM Symp. Comp. Geom., pages 364\u2013372, 1991.","key":"34_CR7","DOI":"10.1145\/109648.109689"},{"key":"34_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-61568-9","volume-title":"Algorithms in Combinatorial Geometry","author":"H. Edelsbrunner","year":"1987","unstructured":"H. Edelsbrunner. Algorithms in Combinatorial Geometry. Springer-Verlag, Berlin, 1987."},{"key":"34_CR9","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1137\/0215024","volume":"15","author":"H. Edelsbrunner","year":"1986","unstructured":"H. Edelsbrunner, J. O'Rourke, and R. Seidel. Constructing arrangements of lines and hyperplanes with applications. SIAM J. Comp., 15:341\u2013363, 1986.","journal-title":"SIAM J. Comp."},{"key":"34_CR10","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0097-3165(86)90078-6","volume":"41","author":"H. Edelsbrunner","year":"1986","unstructured":"H. Edelsbrunner and E. Welzl. On the maximal number of edges of many faces in an arrangement. J. Comb. Theory, A, 41:159\u2013166, 1986.","journal-title":"J. Comb. Theory, A"},{"key":"34_CR11","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0020-0190(91)90076-T","volume":"40","author":"D. Halperin","year":"1991","unstructured":"D. Halperin and M. Sharir. On disjoint concave chains in arrangements of pseudolines. Info. Proc. Let, 40:189\u2013192, Nov. 1991.","journal-title":"Info. Proc. Let"},{"key":"34_CR12","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/BF02579170","volume":"6","author":"S. Hart","year":"1986","unstructured":"S. Hart and M. Sharir. Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes. Combinatorial, 6:151\u2013177, 1986.","journal-title":"Combinatorial"},{"key":"34_CR13","doi-asserted-by":"crossref","first-page":"50","DOI":"10.4064\/cm-3-1-50-57","volume":"3","author":"T. K\u00f6v\u00e1ri","year":"1954","unstructured":"T. K\u00f6v\u00e1ri, V. T. S\u00f3s, and P. Turan. On a problem of K. Zarankeiwicz. Colloq. Math., 3:50\u201357, 1954.","journal-title":"Colloq. Math."},{"key":"34_CR14","first-page":"369","volume-title":"Proc. 9th ICALP, volume 140 of LNCS","author":"A. Lingas","year":"1982","unstructured":"A. Lingas. On the power of non-rectilinear holes. In Proc. 9th ICALP, volume 140 of LNCS, pages 369\u2013383, Berlin, 1982. Springer-Verlag."},{"key":"34_CR15","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1007\/BF02187806","volume":"5","author":"M. S. Paterson","year":"1990","unstructured":"M. S. Paterson and F. F. Yao. Efficient binary space partitions for hidden-surface removal and solid modelling. Disc. & Comp. Geom., 5:485\u2013503, 1990.","journal-title":"Disc. & Comp. Geom."},{"doi-asserted-by":"crossref","unstructured":"J. Ruppert and R. Seidel. On the difficulty of tetrahedralizing 3-dimensional non-convex polyhedra. In Proc. 5th Ann. ACM Symp. Comp. Geom., pages 380\u2013392, 1989.","key":"34_CR16","DOI":"10.1145\/73833.73875"},{"key":"34_CR17","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/BF02187777","volume":"5","author":"R. Wenger","year":"1990","unstructured":"R. Wenger. Upper bounds on geometric permutations for convex sets. Disc. & Comp. Geom., 5:27\u201333, 1990.","journal-title":"Disc. & Comp. Geom."}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory \u2014 SWAT '92"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-55706-7_34.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:01:27Z","timestamp":1605646887000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-55706-7_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540557067","9783540472759"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-55706-7_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]}}}