|
|
|
Abstract
Triangulation Algorithms
Davod Shojaee
MSc Student
Faculty of Geodesy & Geomatics Eng.,
K.N. Toosi University of Technology, Iran
dshojaee@gmail.com
Masood Varshosaz
Assistant Professor
Faculty of Geodesy & Geomatics Eng.
K.N. Toosi University of Technology, Iran
varshosazm@kntu.ac.ir
Hossein Helali
PhD Student
Faculty of Geodesy & Geomatics Eng.
K.N. Toosi University of Technology, Iran
helali@alborz.kntu.ac.ir
Abstract :
Triangulation is a common method for tessellation of domain. Triangulation a set of sample points is an important method with many applications. There are some algorithms for triangulating a point set in two or three dimensions, but just few of them can solve the problem of optimizing the shape of the triangles e.g. Delaunay. Delaunay is the best method for surface modelling and used to reconstruct 3D features, more complicated than 2D ones. The potential of TIN-based methods has been partly exploited in two dimensions but hardly works in three dimensions. In this paper we discussed Delaunay and non-Delaunay algorithms and we investigated them from time and other criteria.
|
|
|