{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:22:12Z","timestamp":1742912532581,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540877431"},{"type":"electronic","value":"9783540877448"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-87744-8_15","type":"book-chapter","created":{"date-parts":[[2008,8,30]],"date-time":"2008-08-30T09:20:52Z","timestamp":1220088052000},"page":"173-184","source":"Crossref","is-referenced-by-count":0,"title":["Decompositions and Boundary Coverings of Non-convex Fat Polyhedra"],"prefix":"10.1007","author":[{"given":"Mark","family":"de Berg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chris","family":"Gray","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/j.comgeo.2007.10.006","volume":"41","author":"B. Aronov","year":"2008","unstructured":"Aronov, B., de Berg, M., Gray, C.: Ray shooting and intersection searching amidst fat convex polyhedra in 3-space. Computational Geometry: Theory and Applications\u00a041, 68\u201376 (2008)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"15_CR2","doi-asserted-by":"publisher","first-page":"1785","DOI":"10.1137\/S0097539794266602","volume":"26","author":"B. Aronov","year":"1997","unstructured":"Aronov, B., Sharir, M.: On translational motion planning of a convex polyhedron in 3-space. SIAM J. Comput.\u00a026, 1785\u20131803 (1997)","journal-title":"SIAM J. Comput."},{"key":"15_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0029813","volume-title":"Ray Shooting, Depth Orders and Hidden Surface Removal","author":"M. de Berg","year":"1993","unstructured":"de Berg, M.: Ray Shooting, Depth Orders and Hidden Surface Removal. LNCS, vol.\u00a0703. Springer, New York (1993)"},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/s004530010047","volume":"28","author":"M. de Berg","year":"2000","unstructured":"de Berg, M.: Linear size binary space partitions for uncluttered scenes. Algorithmica\u00a028, 353\u2013366 (2000)","journal-title":"Algorithmica"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"de Berg, M.: Improved bounds on the union complexity of fat objects. Discr. Comput. Geom. (to appear) doi:10.1007\/s00454-007-9029-7","DOI":"10.1007\/s00454-007-9029-7"},{"key":"15_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-77974-2","volume-title":"Computational Geometry: Algorithms and Applications","author":"M. de Berg","year":"2008","unstructured":"de Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational Geometry: Algorithms and Applications, 3rd edn. Springer, Heidelberg (2008)","edition":"3"},{"issue":"1","key":"15_CR7","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1137\/060672261","volume":"38","author":"M. de Berg","year":"2008","unstructured":"de Berg, M., Gray, C.: Vertical ray shooting and computing depth orders for fat objects. SIAM J. Comput.\u00a038(1), 257\u2013275 (2008)","journal-title":"SIAM J. Comput."},{"key":"15_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-540-73951-7_23","volume-title":"Algorithms and Data Structures","author":"M. de Berg","year":"2007","unstructured":"de Berg, M., Gray, C.: Computing the visibility map of fat objects. In: Dehne, F., Sack, J.-R., Zeh, N. (eds.) WADS 2007. LNCS, vol.\u00a04619, pp. 251\u2013262. Springer, Heidelberg (2007)"},{"key":"15_CR9","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/S0925-7721(03)00016-6","volume":"26","author":"M. de Berg","year":"2003","unstructured":"de Berg, M., David, H., Katz, M.J., Overmars, M., van der Stappen, A.F., Vleugels, J.: Guarding scenes against invasive hypercubes. Comput. Geom. Theory Appl.\u00a026, 99\u2013117 (2003)","journal-title":"Comput. Geom. Theory Appl."},{"key":"15_CR10","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/s00453-002-0961-x","volume":"34","author":"M. de Berg","year":"2002","unstructured":"de Berg, M., van der Stappen, A.F., Vleugels, J., Katz, M.J.: Realistic input models for geometric algorithms. Algorithmica\u00a034, 81\u201397 (2002)","journal-title":"Algorithmica"},{"key":"15_CR11","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1137\/0213031","volume":"13","author":"B. Chazelle","year":"1984","unstructured":"Chazelle, B.: Convex partitions of polyhedra: a lower bound and worst-case optimal algorithm. SIAM J. Comput.\u00a013, 488\u2013507 (1984)","journal-title":"SIAM J. Comput."},{"key":"15_CR12","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/BF02574703","volume":"6","author":"B. Chazelle","year":"1991","unstructured":"Chazelle, B.: Triangulating a simple polygon in linear time. Discr. Comput. Geom.\u00a06, 485\u2013524 (1991)","journal-title":"Discr. Comput. Geom."},{"key":"15_CR13","doi-asserted-by":"publisher","first-page":"775","DOI":"10.1137\/S0097539702407515","volume":"34","author":"A. Efrat","year":"2005","unstructured":"Efrat, A.: The complexity of the union of (\u03b1, \u03b2)-covered objects. SIAM J. Comput.\u00a034, 775\u2013787 (2005)","journal-title":"SIAM J. Comput."},{"key":"15_CR14","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/j.comgeo.2004.08.004","volume":"31","author":"J. Erickson","year":"2005","unstructured":"Erickson, J.: Local polyhedra and geometric graphs. Comput. Geom. Theory Appl.\u00a031, 101\u2013125 (2005)","journal-title":"Comput. Geom. Theory Appl."},{"key":"15_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1007\/978-3-540-75520-3_59","volume-title":"Algorithms \u2013 ESA 2007","author":"P. Hachenberger","year":"2007","unstructured":"Hachenberger, P.: Exact Minkowski sums of polyhedra and exact and efficient decomposition of polyhedra in convex pieces. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol.\u00a04698, pp. 669\u2013680. Springer, Heidelberg (2007)"},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"Keil, J.M.: Polygon Decomposition. In: Sack, J.-R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 491\u2013518 (2000)","DOI":"10.1016\/B978-044482537-7\/50012-7"},{"key":"15_CR17","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/S0925-7721(96)00016-8","volume":"9","author":"M. van Kreveld","year":"1998","unstructured":"van Kreveld, M.: On fat partitioning, fat covering, and the union size of polygons. Comput. Geom. Theory Appl.\u00a09, 197\u2013210 (1998)","journal-title":"Comput. Geom. Theory Appl."},{"key":"15_CR18","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/BF02187840","volume":"7","author":"J. Rupert","year":"1992","unstructured":"Rupert, J., Seidel, R.: On the difficulty of triangulating three-dimensional nonconvex polyhedra. Discr. Comput. Geom.\u00a07, 227\u2013253 (1992)","journal-title":"Discr. Comput. Geom."},{"key":"15_CR19","doi-asserted-by":"crossref","unstructured":"van der Stappen, A.F.: Motion planning amidst fat obstacles. Ph.D.\u00a0thesis, Utrecht University, Utrecht, the Netherlands (1994)","DOI":"10.1145\/177424.177453"}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2008"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-87744-8_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,7]],"date-time":"2024-05-07T05:16:00Z","timestamp":1715058960000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-87744-8_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540877431","9783540877448"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87744-8_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}