An optimal algorithm for constructing the Delaunay triangulation of a set of line segments
SCG '87 Proceedings of the third annual symposium on Computational geometry
Representing stereo data with the Delaunay triangulation
Artificial Intelligence
Rapid 3D Model Acquisition from Images of Small Objects
GMP '00 Proceedings of the Geometric Modeling and Processing 2000
DTM Extraction from Topographic Maps
ICDAR '99 Proceedings of the Fifth International Conference on Document Analysis and Recognition
The Delaunay Constrained Triangulation: The Delaunay Stable Algorithms
IV '99 Proceedings of the 1999 International Conference on Information Visualisation
| Hi-index | 0.00 |
This paper discusses the real-time optimal construction of DTM by two measures. One is to improve coordinate transformation of discrete points acquired from lidar, after processing a total number of 10000 data points, the formula calculation for transformation costs 0.810s, while the table look-up method for transformation costs 0.188s, indicating that the latter is superior to the former. The other one is to adjust the density of the point cloud acquired from lidar, the certain amount of the data points are used for 3D construction in proper proportion in order to meet different needs for 3D imaging, and ultimately increase efficiency of DTM construction while saving system resources.