Monotonous Bisector* Trees — a tool for efficient partitioning of complex scenes of geometric objects
Authors:
- H. NoltemeierHNH. Noltemeier
- K. VerbargKVK. Verbarg
- 1 January 1992
- book chapter
- Published by Springer Nature
- p. 186-203
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Layout of flexible manufacturing systems — selected problems1991
- On separable clusteringsJournal of Algorithms, 1989
- Computational Geometry1985
- A computational geometry approach to clustering problems1985
- Voronoi diagrams based on convex distance functions1985
- A Survey of Recent Advances in Hierarchical Clustering AlgorithmsThe Computer Journal, 1983
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related ProblemsSIAM Journal on Computing, 1983
- A Data Structure and an Algorithm for the Nearest Point ProblemIEEE Transactions on Software Engineering, 1983
- Polygon RetrievalSIAM Journal on Computing, 1982
- Multidimensional binary search trees used for associative searchingCommunications of the ACM, 1975