On constructing binary space partitioning trees

Authors:
Ravinder Krishnaswamy;Ghasem S. Alijani;Shyh-Chang Su
Affiliations:
Auto Trol Technology, Research and Development, 12500 North Washington, Denver, CO;Computer Science Department, University of Wyoming, Laramie, WY;Computer Science Department, University of Wyoming, Laramie, WY
Venue:
CSC '90 Proceedings of the 1990 ACM annual conference on Cooperation
Year:
1990

Citing 7
Cited 0

Fundamentals of interactive computer graphics

Fundamentals of interactive computer graphics
Set operations on polyhedra using binary space partitioning trees

SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
Near real-time shadow generation using BSP trees

SIGGRAPH '89 Proceedings of the 16th annual conference on Computer graphics and interactive techniques
A Characterization of Ten Hidden-Surface Algorithms

ACM Computing Surveys (CSUR)
Near real-time shaded display of rigid objects

SIGGRAPH '83 Proceedings of the 10th annual conference on Computer graphics and interactive techniques
A scan-line hidden surface removal procedure for constructive solid geometry

SIGGRAPH '83 Proceedings of the 10th annual conference on Computer graphics and interactive techniques
Application of binary space partitioning trees to geometric modeling and ray-tracing

Application of binary space partitioning trees to geometric modeling and ray-tracing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Binary Space Partitioning Trees have several applications in computer graphics. We prove that there exist n-polygon problem instances with an O(n2) lower bound on tree size. We also show that a greedy algorithm may result in constructing a tree with O(n2) nodes, while there exist a tree for the same n-polygon instance with only O(n) nodes. Finally, we formulate six different heuristics and test their performance.