An incremental construction algorithm for Delaunay triangulation using the nearest-point paradigm

@article{Zalik2003AnIC,
  title={An incremental construction algorithm for Delaunay triangulation using the nearest-point paradigm},
  author={Borut Zalik and Ivana Kolingerov{\'a}},
  journal={International Journal of Geographical Information Science},
  year={2003},
  volume={17},
  pages={119-138}
}
This paper introduces a new algorithm for constructing a 2D Delaunay triangulation. It belongs to the class of incremental insertion algorithms, which are known as less demanding from the implementation point of view. The most time consuming step of the incremental insertion algorithms is locating the triangle containing the next point to be inserted. In this paper, this task is transformed to the nearest point problem, which is solved by a two-level uniform subdivision acceleration technique… CONTINUE READING
Highly Cited
This paper has 32 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 19 extracted citations

Building TIN (triangular irregular network) problem in Topology model

2010 International Conference on Machine Learning and Cybernetics • 2010
View 3 Excerpts
Highly Influenced

Line extraction algorithm based on image vectorization

2010 IEEE International Conference on Mechatronics and Automation • 2010
View 1 Excerpt

A Fast Algorithm for Constructing Constrained Delaunay Triangulation

2009 IEEE-RIVF International Conference on Computing and Communication Technologies • 2009
View 1 Excerpt

References

Publications referenced by this paper.
Showing 1-10 of 25 references

A fast algorithm constructing Delaunay triangulations in the plane

S W.
(Hong Kong: IEEE Computer Society), • 2001
View 8 Excerpts
Highly Influenced

Geometric & Solid Modelling (San Mateo

C M.
Delaunay and Voronoi diagrams. Algorithmica, • 1989
View 3 Excerpts
Highly Influenced

A Two-Dimensional Quality Mesh Generator and Delaunay T riangulator http://www.cs.berkeley.edu/~jrs/index.html. S

J R.
Association of Computing Machinery), • 2001
View 1 Excerpt

A merge-first divide and conquer algorithm

M C., S R.
CGAL. In Computational Geometry • 2000

Triangulations in CGAL

R. S
Computational Geometry 2000 • 2000

Improvements on Sloan ’ s algorithm for constructing Delaunay triangulations

M. K
Computers & Geosciences • 1998

Fast-randomized point location

M E.P., S I., Z B.
1996

A comparison of sequential Delaunay triangulation algorithms

D R.L.S.
Advanced Engineering Software and Workstations, • 1995

Similar Papers

Loading similar papers…