Download:
|
by T. M. Murali, Pankaj K. Agarwal, Jeffrey Scott Vitter
http://www.cs.duke.edu/~tmax/papers/new-rects-bsp.ps.gz
Add To MetaCart
Abstract:
Abstract. In this paper, we develop a simple technique for constructing a Binary Space Partition (BSP) for a set of orthogonal rectangles in R 3 Our algorithm has the novel feature that it tunes its performance to the geometric properties of the rectangles, e.g., their aspect ratios. We have implemented our algorithm and tested its performance on real data sets. We have also systematically compared the performance of our algorithm with that of other techniques presented in the literature. Our studies show that our algorithm constructs BSPs of near-linear size and small height in practice, has fast running times, and answers queries efficiently. It is a method of choice for constructing BSPs for orthogonal rectangles. 1
Citations
|
789
|
Computer Graphics: Principles and Practice
– Foley, Dam, et al.
- 1997
|
|
269
|
On visible surface generation by a priori tree structures
– Fuchs, Kedem, et al.
- 1980
|
|
116
|
Visibility Computations in Densely Occluded Polyhedral Environments
– Teller
- 1992
|
|
113
|
Set Operations on Polyhedra Using Binary Space Partitioning Trees
– Thibault, Naylor
|
|
88
|
Near Real-Time Shadow Generation Using BSP Trees
– Chin, Feiner
|
|
83
|
Surface approximation and geometric partitions
– AGARWAL, SURI
- 1998
|
|
83
|
Efficient binary space partitions for hidden-surface removal and solid modeling. Discrete Comput. Geom
– Paterson, Yao
- 1990
|
|
78
|
Increasing Update Rates in the Building Walkthrough System with Automatic Model-Space Subdivision and Potentially Visible Set Calculations
– Airey
|
|
78
|
Merging BSP Trees Yields Polyhedral Set Operations
– Naylor, Amanatides, et al.
|
|
64
|
Fast object-precision shadow generation for areal light sources using BSP trees
– Chin, Feiner
- 1992
|
|
64
|
Approximation algorithms for geometric tour and network design problems
– Mata, Mitchell
- 1995
|
|
54
|
Study for Applying Computer-Generated Images to Visual Simulation
– Schumacker, Brand, et al.
- 1969
|
|
48
|
Consistent solid and boundary representations from arbitrary polygonal data
– Murali, Funkhouser
- 1997
|
|
48
|
Optimal binary space partitions for orthogonal objects
– Paterson, Yao
- 1992
|
|
43
|
size binary space partitions for fat objects
– Berg, Linear
- 1995
|
|
26
|
Modeling Global Diffuse Illumination for Image Synthesis
– Campbell
- 1991
|
|
26
|
Constructing good partitioning trees
– NAYLOR
- 1993
|
|
25
|
Binary space partitions for fat rectangles
– Agarwal, Grove, et al.
- 1993
|
|
20
|
Application of BSP trees to ray-tracing and CSG evaluation
– Naylor, Thibault
- 1986
|
|
12
|
Near-optimal construction of partitioning trees by evolutionary techniques
– Cassen, Subramanian, et al.
- 1995
|
|
1
|
Understanding the preparation and analysis of solid models, in: Techniques for Computer Graphics
– Muus
|
|
1
|
Applications of computational geometry in army research and development
– Tanenbaum
|
