• Corpus ID: 10232561

Hierarchical Plane Extraction (HPE): An Efficient Method For Extraction Of Planes From Large Pointcloud Datasets

@inproceedings{Subramaniam2014HierarchicalPE,
  title={Hierarchical Plane Extraction (HPE): An Efficient Method For Extraction Of Planes From Large Pointcloud Datasets},
  author={Naveen Anand Subramaniam and Kevin Ponto},
  year={2014}
}
This paper describes a fast and efficient algorithm to obtain planar models from high density 3D pointclouds using spatial hashing. 

Tables from this paper

EXTRACTION OF MAIN LEVELS OF A BUILDING FROM A LARGE POINT CLOUD
TLDR
A strategy to automatically detect the building levels from a large point cloud obtained with a terrestrial laser scanner survey is presented, based on plane extraction by means of the RANSAC algorithm followed by the minimization of the quadrate sum of points-plane distance.
Automated Analysis of Mobile LiDAR Data for Component‐Level Damage Assessment of Building Structures during Large Coastal Storm Events
  • Zixiang Zhou, J. Gong
  • Environmental Science, Engineering
    Comput. Aided Civ. Infrastructure Eng.
  • 2018
Rapid assessment of building damages due to natural disasters is a critical element in disaster management. Although airborne‐based remote sensing techniques have been successfully applied in many
Simulating the experience of home environments
TLDR
A novel approach to the problem of quality-interactivity trade-off through a progressive feedback-driven rendering algorithm that uses reprojections of past views to accelerate the reconstruction of the current view and can be used to extend existing point cloud viewing algorithms.

References

SHOWING 1-10 OF 35 REFERENCES
Efficient processing of large 3D point clouds
TLDR
An efficient octree to store and compress 3D data without loss of precision is proposed and its usage for fast 3D scan matching and shape detection algorithms is demonstrated.
Efficient RANSAC for Point‐Cloud Shape Detection
TLDR
An automatic algorithm to detect basic shapes in unorganized point clouds based on random sampling and detects planes, spheres, cylinders, cones and tori, and obtains a representation solely consisting of shape proxies.
Reverse Engineering Regular Objects: Simple Segmentation and Surface Fitting Procedures
TLDR
A non-iterative algorithm for direct segmentation is presented, where well-known techniques from computer vision are combined with new procedures for processing point and normal vector data, based on laser scanned point clouds with relatively high density and high accuracy.
Identifying Planes in Point Clouds for Efficient Hybrid Rendering
TLDR
A hybrid rendering technique for highfeature colored point clouds that achieves both, high performance and high quality, and the spatial subdivision facilitates handling out-of-core point clouds, both in preprocessing and rendering.
3D BUILDING MODEL RECONSTRUCTION FROM POINT CLOUDS AND GROUND PLANS
Airborne laser altimetry has become a very popular technique for the acquisition of digital elevation models. The high point density that can be achieved with this technique enables applications of
Recognising structure in laser scanning point clouds
Both airborne and terrestrial laser scanners are used to capture large point clouds of the objects under study. Although for some applications, direct measurements in the point clouds may already
Hough-Transform and Extended RANSAC Algorithms for Automatic Detection of 3D Building Roof Planes from Lidar Data
TLDR
The proposed extension of RANSAC algorithm allows harmonizing the mathematical aspect of the algorithm with the geometry of a roof, and it is shown that the extended approach provides very satisfying results, even in the case of very weak point density and for different levels of building complexity.
Image‐based 3D Modelling: A Review
In this paper the main problems and the available solutions are addressed for the generation of 3D models from terrestrial images. Close range photogrammetry has dealt for many years with manual or
POP: a hybrid point and polygon rendering system for large data
TLDR
This work uses both points and polygons to represent and render large mesh models and starts from triangles as leaf nodes and builds up a hierarchical tree structure with intermediate nodes as points.
...
1
2
3
4
...