Sciweavers

14 search results - page 1 / 3
» Binary space partitions for 3D subdivisions
Sort
View
SODA
2003
ACM
127views Algorithms» more  SODA 2003»
13 years 6 months ago
Binary space partitions for 3D subdivisions
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 subdiv...
John Hershberger, Subhash Suri
COMPGEOM
2004
ACM
13 years 10 months ago
Binary space partitions of orthogonal subdivisions
We consider the problem of constructing binary space partitions (BSPs) for orthogonal subdivisions (space filling packings of boxes) in d-space. We show that a subdivision with n...
John Hershberger, Subhash Suri, Csaba D. Tó...
3DPVT
2006
IEEE
257views Visualization» more  3DPVT 2006»
13 years 11 months ago
3D from Line Segments in Two Poorly-Textured, Uncalibrated Images
This paper addresses the problem of camera selfcalibration, bundle adjustment and 3D reconstruction from line segments in two images of poorly-textured indoor scenes. First, we ge...
Herbert Bay, Andreas Ess, Alexander Neubeck, Luc J...
TVCG
2008
104views more  TVCG 2008»
13 years 4 months ago
A Generic Scheme for Progressive Point Cloud Coding
In this paper, we propose a generic point cloud encoder that provides a unified framework for compressing different attributes of point samples corresponding to 3D objects with an ...
Yan Huang, Jingliang Peng, C. C. Jay Kuo, M. Gopi
SIBGRAPI
2006
IEEE
13 years 11 months ago
Point set compression through BSP quantization
This work introduces a new compression scheme for point sets. This scheme relies on an adaptive binary space partition (BSP) which takes into account the geometric structure of the...
Alex Laier Bordignon, Thomas Lewiner, Hélio...