{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:56:07Z","timestamp":1725663367800},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540548911"},{"type":"electronic","value":"9783540464594"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54891-2_3","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T18:16:53Z","timestamp":1330193813000},"page":"27-35","source":"Crossref","is-referenced-by-count":1,"title":["An on-line algorithm for constructing sweep planes in regular position"],"prefix":"10.1007","author":[{"given":"Hanspeter","family":"Bieri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter-Michael","family":"Schmidt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,29]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1109\/TC.1979.1675432","volume":"C-28","author":"J. L. Bentley","year":"1979","unstructured":"Bentley, J.L., Ottmann, T.A.: Algorithms for reporting and counting geometric intersections. IEEE Transactions on Computers C-28, 643\u2013647 (1979).","journal-title":"IEEE Transactions on Computers"},{"unstructured":"Beretta, G., Meier, A.: Scan Converting Polygons Based on Plane-Sweep. Technical Report 68, Institut f\u00fcr Informatik, ETHZ (1986).","key":"3_CR2"},{"key":"3_CR3","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/0024-3795(83)80008-1","volume":"52\/53","author":"H. Bieri","year":"1983","unstructured":"Bieri, H., Nef, W.: A sweep-plane algorithm for computing the volume of polyhedra represented in Boolean form. Linear Algebra Appl. 52\/53, 69\u201397 (1983).","journal-title":"Linear Algebra Appl."},{"key":"3_CR4","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/BF02251831","volume":"34","author":"H. Bieri","year":"1985","unstructured":"Bieri, H., Nef, W.: A sweep-plane algorithm for computing the Euler-characteristic of polyhedra represented in Boolean form. Computing 34, 287\u2013302 (1985).","journal-title":"Computing"},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1145\/77635.77639","volume":"9","author":"H. Edelsbrunner","year":"1990","unstructured":"Edelsbrunner, H., M\u00fccke, E.P.: Simulation of Simplicity: A technique to cope with degenerate cases in geometric algorithms. ACM Transactions on Graphics 9, 66\u2013104 (1990).","journal-title":"ACM Transactions on Graphics"},{"key":"3_CR6","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/BF01840357","volume":"2","author":"S. Fortune","year":"1987","unstructured":"Fortune, S.: A sweepline algorithm for Voronoi diagrams. Algorithmica 2, 153\u2013174 (1987).","journal-title":"Algorithmica"},{"key":"3_CR7","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1515\/crll.1955.194.101","volume":"194","author":"H. Hadwiger","year":"1955","unstructured":"Hadwiger, H.: Eulers Charakteristik und kombinatorische Geometrie. J. reine angew. Math. 194, 101\u2013110 (1955).","journal-title":"J. reine angew. Math."},{"key":"3_CR8","first-page":"121","volume":"23","author":"H. Hadwiger","year":"1968","unstructured":"Hadwiger, H.: Eine Schnittrekursion f\u00fcr die Eulersche Charakteristik euklidischer Polyeder mit Anwendungen innerhalb der kombinatorischen Geometrie. Elem. Math. 23, 121\u2013132 (1968).","journal-title":"Elem. Math."},{"key":"3_CR9","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0020-0190(88)90150-0","volume":"26","author":"K. Hinrichs","year":"1988","unstructured":"Hinrichs, K., Nievergelt, J., Schorn, P.: Plane-sweep solves the closest pair problem elegantly. Information Processing Letters 26, 255\u2013261 (1988).","journal-title":"Information Processing Letters"},{"unstructured":"Hinrichs, K., Nievergelt, J., Schorn, P.: An all-round sweep algorithm for 2-dimensional nearest-neighbor problems. To appear.","key":"3_CR10"},{"key":"3_CR11","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1080\/0025570X.1978.11976718","volume":"51","author":"J. W. Kerr","year":"1978","unstructured":"Kerr, J.W., Wetzel, J.E.: Platonic divisions of space. Mathematical Magazine 51, 229\u2013234 (1978).","journal-title":"Mathematical Magazine"},{"key":"3_CR12","doi-asserted-by":"crossref","first-page":"1072","DOI":"10.1109\/TC.1984.1676388","volume":"C-33","author":"D. T. Lee","year":"1984","unstructured":"Lee, D.T., Preparata, F.P.: Computational geometry \u2014 a survey. IEEE Transactions on Computers C-33, 1072\u20131101 (1984).","journal-title":"IEEE Transactions on Computers"},{"doi-asserted-by":"crossref","unstructured":"Mehlhorn, K.: Data Structures and Algorithms 3. Multi-dimensional Searching and Computational Geometry. Springer-Verlag 1984.","key":"3_CR13","DOI":"10.1007\/978-3-642-69900-9_2"},{"doi-asserted-by":"crossref","unstructured":"M\u00fcller, H.: Realistische Computergraphik. Algorithmen, Datenstrukturen und Maschinen. Informatik-Fachberichte 163. Springer-Verlag 1988.","key":"3_CR14","DOI":"10.1007\/978-3-642-73416-8"},{"key":"3_CR15","doi-asserted-by":"crossref","first-page":"633","DOI":"10.1016\/S0747-7171(08)80162-9","volume":"10","author":"W. Nef","year":"1990","unstructured":"Nef, W., Schmidt, P.-M.: Computing a sweeping-plane in regular (\u201cgeneral\u201d) position: A numerical and a symbolic solution. J. Symbolic Computation 10, 633\u2013646 (1990).","journal-title":"J. Symbolic Computation"},{"doi-asserted-by":"crossref","unstructured":"Preparata, F.P., Shamos, M.I.: Computational Geometry \u2014 An Introduction. Springer-Verlag 1985.","key":"3_CR16","DOI":"10.1007\/978-1-4612-1098-6"},{"unstructured":"Schmidt, P.-M.: About the Precision of the Coefficients of a Sweeping-Plane. In U. Eckhardt et al. (Eds.): Geometrical Problems of Image Processing. Research in Informatics, Vol. 4, 107\u2013113. Akademie Verlag 1991.","key":"3_CR17"},{"unstructured":"Sedgewick,R.: Algorithms. Addison-Wesley, 2nd Ed. 1988.","key":"3_CR18"},{"unstructured":"Shamos, M.I.: Computational Geometry. Ph.D. Thesis, Yale University, 1978. University Microfilms International.","key":"3_CR19"},{"unstructured":"Wood, D.: Paradigms and Programming with Pascal. Computer Science Press 1984.","key":"3_CR20"}],"container-title":["Lecture Notes in Computer Science","Computational Geometry-Methods, Algorithms and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54891-2_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T14:12:41Z","timestamp":1687270361000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54891-2_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540548911","9783540464594"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-54891-2_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}