Abstract
This paper studied an efficient and practical algorithm for Delaunay TIN generation and real time updating from mass geographic data in the environment of paralleling. For the efficient request of mass data, the paper puts forward a merging method of generating the Delaunay TIN. The method is simple and efficient. It is easy to parallel process and pipeline work.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Floriani, L.D., Puppo, E.: An On-line Algorithm for Constrained Delaunay Triangulation. CVGlP: Graphical Models and Image Processing 54(3), 290–300 (1992)
Preparata, F.P.: Computation Geometry: an Introduction. Springer, New York (1985)
Cignoni, P., Montanil, C., Scopigno, R.D.: A Fast Divide and Conquer Delaunay Triangulation Algorithm. Computer Aided Design 30(5), 333–341 (1998)
Larkin, B.J.: An ANSI C program to determine in expected linear time the vertices of the convex hull of a set of planar points. Computers & Geosciences 17(3), 431–443 (1997)
Sedgewick, R.: Algorithms. Addison-Wesley, New York (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, Y., Zhang, L., Xu, H. (2011). Algorithm Research on Delaunay TIN Generation and Real Time Updating. In: Jin, D., Lin, S. (eds) Advances in Computer Science, Intelligent System and Environment. Advances in Intelligent and Soft Computing, vol 105. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23756-0_121
Download citation
DOI: https://doi.org/10.1007/978-3-642-23756-0_121
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23755-3
Online ISBN: 978-3-642-23756-0
eBook Packages: EngineeringEngineering (R0)