{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T04:47:16Z","timestamp":1755838036995,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540646822"},{"type":"electronic","value":"9783540691068"}],"license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0054377","type":"book-chapter","created":{"date-parts":[[2006,6,7]],"date-time":"2006-06-07T07:43:28Z","timestamp":1149666208000},"page":"300-309","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Output-sensitive cell enumeration in hyperplane arrangements"],"prefix":"10.1007","author":[{"given":"Nora","family":"Sleumer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,5,26]]},"reference":[{"key":"28_CR1","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0166-218X(95)00026-N","volume":"65","author":"D. Avis","year":"1996","unstructured":"D. Avis and K. Fukuda. Reverse search for enumeration. Discrete Applied Mathematics, 65:21\u201346, 1996.","journal-title":"Discrete Applied Mathematics"},{"key":"28_CR2","doi-asserted-by":"crossref","unstructured":"D. Bremner, K. Fukuda, and A. Marzetta. Primal-dual methods for vertex and facet enumeration. In Proceedings of the 13th Annual ACM Symposium on Computational Geometry (SoCG), pages 49\u201356, 1997.","DOI":"10.1145\/262839.262861"},{"key":"28_CR3","unstructured":"A. Br\u00fcngger, A. Marzetta, K. Fukuda, and J. Nievergelt. The Parallel Search Bench ZRAM and its Applications. To appear in: Annals of Operations Research. PS file available from ftp:\/\/ftp.ifor.ethz.ch\/pub\/fukuda\/reports, 1996."},{"key":"28_CR4","unstructured":"A. Bjorner, M. Las Vergnas, B. Sturmfels, N. White, and G. Ziegler. Oriented Matroids, volume 46. Cambridge University Press, 1993."},{"key":"28_CR5","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, Heidelberg, 1987."},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"H. Edelsbrunner and L. Guibas. Topologically sweeping an arrangement. In Proceedings of the 18th ACM Symposium on the Theory Computing (STOC), pages 389\u2013403, 1986.","DOI":"10.1145\/12130.12171"},{"issue":"2","key":"28_CR7","doi-asserted-by":"publisher","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 Journal on Computing, 15(2):341\u2013363, 1986.","journal-title":"SIAM Journal on Computing"},{"key":"28_CR8","unstructured":"K. Fukuda. cdd+ Reference Manual. PS file available from ftp:\/\/ftp.ifor.ethz.ch\/pub\/fukuda\/cdd, 1995."},{"key":"28_CR9","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1145\/27625.27627","volume":"6","author":"M. McKenna","year":"1987","unstructured":"M. McKenna. Worst-case optimal hidden-surface removal. ACM Transactions on Graphics, 6:19\u201328, 1987.","journal-title":"ACM Transactions on Graphics"},{"key":"28_CR10","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1145\/2422.322418","volume":"31","author":"N. Megiddo","year":"1984","unstructured":"N. Megiddo. Linear programming in linear time when dimension is fixed. Journal of the ACM, 31:114\u2013127, 1984.","journal-title":"Journal of the ACM"},{"issue":"2","key":"28_CR11","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1142\/S0218195996000174","volume":"6","author":"J. O'Rourke","year":"1996","unstructured":"J. O'Rourke. Computational geometry column 28. International Journal of Computational Geometry and Applications, 6(2):243\u2013244, 1996.","journal-title":"International Journal of Computational Geometry and Applications"},{"key":"28_CR12","doi-asserted-by":"crossref","unstructured":"T. Ottmann, S. Schuierer, and S. Soundaralakshmi. Enumerating extreme points in higher dimensions. In Proceedings of the 12th Symposium on the Theoretical Aspects of Computer Science (STACS), volume 900 of LNCS, pages 562\u2013570. Springer-Verlag, 1995.","DOI":"10.1007\/3-540-59042-0_105"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory \u2014 SWAT'98"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0054377","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,17]],"date-time":"2023-02-17T23:24:10Z","timestamp":1676676250000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/BFb0054377"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540646822","9783540691068"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/bfb0054377","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]},"assertion":[{"value":"26 May 2006","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}