Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

14

SODA
2003
ACM

favoriteEmaildiscussreport

127views Algorithms» more SODA 2003»

Binary space partitions for 3D subdivisions

13 years 6 months ago

Binary space partitions for 3D subdivisions

Download www.cs.ucsb.edu

We consider the following question: Given a subdivision of space into n convex polyhedral cells, what is the worst-case complexity of a binary space partition (BSP) for the subdivision? We show that if the subdivision is rectangular and axis-aligned, then the worstcase complexity of an axis-aligned BSP is Ω(n4/3 ) and O(nα log2

John Hershberger, Subhash Suri

Real-time Traffic

Algorithms | Binary Space Partition | Convex Polyhedral Cells | SODA 2003 | Worst-case Complexity |

claim paper

Related Content

» Binary space partitions of orthogonal subdivisions

» 3D from Line Segments in Two PoorlyTextured Uncalibrated Images

» A Generic Scheme for Progressive Point Cloud Coding

» Point set compression through BSP quantization

» Occlusion Evaluation in Hierarchical Radiosity

» Shadow Volume BSP Trees for Computation of Shadows in Dynamic Scenes

» View volume culling using a probabilistic caching scheme

» Signatures of Combinatorial Maps

» Multiresolution BSP Trees Applied to Terrain Transparency and General Objects

Post Info
More Details (n/a)

Added	01 Nov 2010
Updated	01 Nov 2010
Type	Conference
Year	2003
Where	SODA
Authors	John Hershberger, Subhash Suri

Comments (0)