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...
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...
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...
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 ...
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...