{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T14:12:52Z","timestamp":1742998372414,"version":"3.40.3"},"publisher-location":"New York, NY","reference-count":8,"publisher":"Springer New York","isbn-type":[{"type":"print","value":"9781493928637"},{"type":"electronic","value":"9781493928644"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-1-4939-2864-4_590","type":"book-chapter","created":{"date-parts":[[2016,4,21]],"date-time":"2016-04-21T20:03:35Z","timestamp":1461269015000},"page":"909-914","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Hierarchical Space Decompositions for Low-Density Scenes"],"prefix":"10.1007","author":[{"given":"Mark","family":"de Berg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,4,22]]},"reference":[{"issue":"3","key":"176_CR862","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/s004530010047","volume":"28","author":"M Berg De","year":"2000","unstructured":"De Berg M (2000) Linear size binary space partitions for uncluttered scenes. Algorithmica 28(3):353\u2013366","journal-title":"Algorithmica"},{"key":"176_CR863","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77974-2","volume-title":"Computational geometry: algorithms and applications","author":"M Berg De","year":"2008","unstructured":"De Berg M, Cheong O, Van Kreveld M, Overmars M (2008) Computational geometry: algorithms and applications, 3rd edn. Springer, Berlin\/Heidelberg","edition":"3"},{"issue":"1","key":"176_CR864","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/s00453-002-0961-x","volume":"34","author":"M Berg De","year":"2002","unstructured":"De Berg M, Katz M, Van der Stappen AF, Vleugels J (2002) Realistic input models for geometric algorithms. Algorithmica 34(1):81\u201397","journal-title":"Algorithmica"},{"key":"176_CR865","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1016\/j.comgeo.2009.11.001","volume":"43","author":"M Berg De","year":"2010","unstructured":"De Berg M, Haverkort H, Thite S, Toma L (2010) Star-quadtrees and guard-quadtrees: I\/O-efficient indexes for fat triangulations and low-density planar subdivisions. Comput Geom Theory Appl 43:493\u2013513","journal-title":"Comput Geom Theory Appl"},{"issue":"3","key":"176_CR866","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1137\/0213031","volume":"13","author":"B Chazelle","year":"1984","unstructured":"Chazelle B (1984) Convex partitions of polyhedra: a lower bound and worst-case optimal algorithm. SIAM J Comput 13(3):488\u2013507","journal-title":"SIAM J Comput"},{"issue":"5","key":"176_CR867","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/BF02187806","volume":"5","author":"MS Paterson","year":"1990","unstructured":"Paterson MS and Yao FF (1990) Efficient binary space partitions for hidden-surface removal and solid modeling. Discret Comput Geom 5(5):485\u2013503","journal-title":"Discret Comput Geom"},{"issue":"1","key":"176_CR868","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s00454-003-2921-x","volume":"30","author":"CD T\u00f3th","year":"2003","unstructured":"T\u00f3th CD (2003) A note on binary plane partitions. Discret Comput Geom 30(1):3\u201316","journal-title":"Discret Comput Geom"},{"issue":"4","key":"176_CR869","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1007\/s00454-011-9341-0","volume":"45","author":"CD T\u00f3th","year":"2011","unstructured":"T\u00f3th CD (2011) Binary plane partitions for disjoint line segments. Discret Comput Geom 45(4):617\u2013646","journal-title":"Discret Comput Geom"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4939-2864-4_590","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T16:11:39Z","timestamp":1553098299000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4939-2864-4_590"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9781493928637","9781493928644"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-1-4939-2864-4_590","relation":{},"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}