Numerical methods and programming
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Num. Meth. Prog.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Numerical methods and programming, 2002, Volume 3, Issue 1, Pages 14–39 (Mi vmp738)  
This article is cited in 10 scientific papers (total in 10 papers)

A survey of algorithms for constructing a Delaunay triangulation

A. V. Skvortsov

Tomsk State University
Full-text PDF (584 kB) Citations (10)
Abstract: A large number of widely used algorithms for constructing a Delaunay triangulation are considered. A classification of these algorithms is proposed. Their performance evaluation is given for the average and worst cases. Some peculiarities of their realization are discussed. Four data structures for the representation of triangulation are analyzed. Several procedures for checking the Delaunay condition and for the triangulation merging are described.
Keywords: triangulation, computational geometry, computer graphics, grid construction, data structure.
UDC: 519.688
Language: Russian
Citation: A. V. Skvortsov, “A survey of algorithms for constructing a Delaunay triangulation”, Num. Meth. Prog., 3:1 (2002), 14–39
Citation in format AMSBIB
\Bibitem{Skv02}
\by A.~V.~Skvortsov
\paper A survey of algorithms for constructing a Delaunay triangulation
\jour Num. Meth. Prog.
\yr 2002
\vol 3
\issue 1
\pages 14--39
\mathnet{http://mi.mathnet.ru/vmp738}
Linking options:
  • https://www.mathnet.ru/eng/vmp738
  • https://www.mathnet.ru/eng/vmp/v3/i1/p14
    • This publication is cited in the following 10 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Numerical methods and programming
    Statistics & downloads:
    Abstract page:1004
    Full-text PDF :550
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024