Simple and practical geometric algorithms
ACM Computing Surveys (CSUR) - Special issue: position statements on strategic directions in computing research
Output-senstitive rendering and communication in dynamic virtual environments
VRST '97 Proceedings of the ACM symposium on Virtual reality software and technology
Cylindrical static and kinetic binary space partitions
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Practical techniques for constructing binary space partitions for orthogonal rectangles
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Lower bounds for kinetic planar subdivisions
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Balanced aspect ratio trees: combining the advantages of k-d trees and octrees
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Slice and dice: a simple, improved approximate tiling recipe
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Constructing Binary Space Partitions for Orthogonal Rectabgles in Practice
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops
| Hi-index | 0.01 |
The authors consider the practical problem of constructing binary space partitions (BSPs) for a set S of n orthogonal, nonintersecting, two-dimensional rectangles in R/sup 3/ such that the aspect ratio of each rectangle in S is at most /spl alpha/, for some constant a /spl alpha//spl ges/1. They present an n2/sup O(/spl radic/logn)/-time algorithm to build a binary space partition of size n2/sup O(/spl radic/logn)/ for S. They also show that if m of the n rectangles in S have aspect ratios greater than /spl alpha/, they can contact a BSP of size n/spl radic/m2/sup O(/spl radic/logn)/ for S in n/spl radic/2/sup O(/spl radic/logn)/ time. The constants of proportionality in the big-oh terms are linear in log /spl alpha/. They extend these results to cases in which the input contains non-orthogonal or intersecting objects.