{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T11:58:10Z","timestamp":1742385490127},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540554882"},{"type":"electronic","value":"9783540471035"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-55488-2_27","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T10:08:12Z","timestamp":1330250892000},"page":"186-203","source":"Crossref","is-referenced-by-count":32,"title":["Monotonous Bisector* Trees \u2014 a tool for efficient partitioning of complex scenes of geometric objects"],"prefix":"10.1007","author":[{"given":"H.","family":"Noltemeier","sequence":"first","affiliation":[],"role":[{"role":"author","vocab":"crossref"}]},{"given":"K.","family":"Verbarg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocab":"crossref"}]},{"given":"C.","family":"Zirkelbach","sequence":"additional","affiliation":[],"role":[{"role":"author","vocab":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,29]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"J. L. Bentley, Multidimensional Binary Search Trees Used for Associative Searching, Communications of the ACM, Vol. 18, No. 9, 1975","DOI":"10.1145\/361002.361007"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"L. P. Chew, R. L. Drysdale III, Voronoi Diagrams Based on Convex Distance Functions, 1st ACM Symposium on Computational Geometry, Baltimore, Maryland, 1985","DOI":"10.1145\/323233.323264"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"F. Dehne and H. Noltemeier, A Computational Geometry Approach to Clustering Problems, Proceedings of the 1st ACM Symposium on Computational Geometry, Baltimore, Maryland, 1985","DOI":"10.1145\/323233.323265"},{"key":"9_CR4","volume-title":"Voronoi Trees and Clustering Problems, Information Systems","author":"F. Dehne","year":"1987","unstructured":"F. Dehne and H. Noltemeier, Voronoi Trees and Clustering Problems, Information Systems, Vol. 12, No. 2, Pergamon London, 1987."},{"key":"9_CR5","volume-title":"EATCS Monographs in Computer Science, Vol. 10","author":"H. Edelsbrunner","year":"1987","unstructured":"H. Edelsbrunner, Algorithms in Combinatorial Geometry, EATCS Monographs in Computer Science, Vol. 10, Springer-Verlag, Berlin-Heidelberg, 1987"},{"key":"9_CR6","volume-title":"LNCS 337","author":"O. G\u00fcnther","year":"1988","unstructured":"O. G\u00fcnther, Efficient Structures for Geometric Data Management, LNCS 337 (ed. G. Goos, J. Hartmanis), Springer, Berlin-Heidelberg, 1988"},{"key":"9_CR7","unstructured":"H. Heusinger, Clusterverfahren f\u00fcr Mengen geometrischer Objekte, Report, Universit\u00e4t W\u00fcrzburg, 1989"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"H. Heusinger und H. Noltemeier, On Separable Clusterings, Journal of Algorithms, Vol. 10, Academic Press, 1989","DOI":"10.1016\/0196-6774(89)90013-8"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"I. Kalantari, G. McDonald, A Data Structure and an Algorithm for the Nearest Point Problem, IEEE Transactions on Software Engineering, Vol. SE-9, No.5, 1983","DOI":"10.1109\/TSE.1983.235263"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"N. Megiddo, Linear-Time Algorithms for Linear Programming in IR 3 and Related Problems, SIAM Journal of Comput., Vol. 12, 1983","DOI":"10.1137\/0212052"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"F. Murtagh, A Survey of Recent Advances in Hierarchical Clustering Algorithms, The Computer Journal, Vol. 26, No. 4, 1983","DOI":"10.1093\/comjnl\/26.4.354"},{"key":"9_CR12","unstructured":"H. Noltemeier, Voronoi Trees and Applications, in H. Imai (ed.): \u201dDiscrete Algorithms and Complexity\u201d (Proceedings), Fukuoka\/Japan, 1989"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"H. Noltemeier, Layout of Flexible Manufacturing Systems \u2014 Selected Problems, Proceedings of the Workshop on Applications of Combinatorial Optimization in Science and Technology (COST), New Brunswick, New Jersey, 1991","DOI":"10.1007\/3-540-54891-2_16"},{"key":"9_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry \u2014 An Introduction","author":"F. P. Preparata","year":"1985","unstructured":"F.P. Preparata and M.I. Shamos, Computational Geometry \u2014 An Introduction, Springer-Verlag, New York, 1985"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"H. Samet, The Quadtree and Related Hierarchical Data Structures, ACM Computing Surveys, Vol. 16, 1984","DOI":"10.1145\/356924.356930"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"D. E. Willard, Polygon Retrieval, SIAM J. Comput., Vol. 11,No. 1, 1982","DOI":"10.1137\/0211012"},{"key":"9_CR17","unstructured":"C. Zirkelbach, Monotonous Bisector Trees and Clustering Problems, Techn. Report, Universit\u00e4t W\u00fcrzburg, 1990"},{"key":"9_CR18","unstructured":"C. Zirkelbach, Partionierung mit Bisektoren, Techn. Report, Universit\u00e4t W\u00fcrzburg, 1990"},{"key":"9_CR19","unstructured":"C. Zirkelbach, Monotone Bisektor * B\u00e4ume unter Minkowski-Metrik, Techn. Report, Universit\u00e4t W\u00fcrzburg, 1991"}],"container-title":["Lecture Notes in Computer Science","Data structures and efficient algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-55488-2_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:59:10Z","timestamp":1605646750000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-55488-2_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540554882","9783540471035"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-55488-2_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]}}}