A new approach to the maximum-flow problem
Journal of the ACM (JACM)
A Delaunay refinement algorithm for quality 2-dimensional mesh generation
SODA '93 Selected papers from the fourth annual ACM SIAM symposium on Discrete algorithms
A condition guaranteeing the existence of higher-dimensional constrained Delaunay triangulations
Proceedings of the fourteenth annual symposium on Computational geometry
A simple algorithm for homeomorphic surface reconstruction
Proceedings of the sixteenth annual symposium on Computational geometry
Geometric structures for three-dimensional shape representation
ACM Transactions on Graphics (TOG)
Reconstruction and representation of 3D objects with radial basis functions
Proceedings of the 28th annual conference on Computer graphics and interactive techniques
Updating and constructing constrained delaunay and constrained regular triangulations by flips
Proceedings of the nineteenth annual symposium on Computational geometry
Tight cocone: a water-tight surface reconstructor
SM '03 Proceedings of the eighth ACM symposium on Solid modeling and applications
Interpolating and approximating implicit surfaces from polygon soup
ACM SIGGRAPH 2004 Papers
An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision
IEEE Transactions on Pattern Analysis and Machine Intelligence
Voronoi-based variational reconstruction of unoriented point sets
SGP '07 Proceedings of the fifth Eurographics symposium on Geometry processing
Recovering structure from r-sampled objects
SGP '09 Proceedings of the Symposium on Geometry Processing
Surface reconstruction from LiDAR data with extended snake theory
EMMCVPR'07 Proceedings of the 6th international conference on Energy minimization methods in computer vision and pattern recognition
Cone carving for surface reconstruction
ACM SIGGRAPH Asia 2010 papers
On the shape of a set of points in the plane
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
The demand for large geometric models is increasing, especially of urban environments. This has resulted in production of massive point cloud data from images or LiDAR. Visualization and further processing generally require a detailed, yet concise representation of the scene's surfaces. Related work generally either approximates the data with the risk of over-smoothing, or interpolates the data with excessive detail. Many surfaces in urban scenes can be modeled more concisely by planar approximations. We present a method that combines these polygons into a watertight model. The polygon-based shape is closed with free-form meshes based on visibility information. To achieve this, we divide 3-space into inside and outside volumes by combining a constrained Delaunay tetrahedralization with a graph-cut. We compare our method with related work on several large urban LiDAR data sets. We construct similar shapes with a third fewer triangles to model the scenes. Additionally, our results are more visually pleasing and closer to a human modeler's description of urban scenes using simple boxes.