An incremental construction algorithm for Delaunay triangulation using the nearest-point paradigm
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F03%3A00000081" target="_blank" >RIV/49777513:23520/03:00000081 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
An incremental construction algorithm for Delaunay triangulation using the nearest-point paradigm
Original language description
This paper introduces a new algorithm for constructing a 2D Delaunay triangulation. The triangle containing the next point to be inserted is transformed to the nearest point problem, which is solved by a two-level uniform subdivision acceleration technique. The proposed algorithm is simple, so it represents an attractive alternative to other Delaunaay triangulation algorithms used in practice.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
JC - Computer hardware and software
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/ME%20298" target="_blank" >ME 298: Science and Technology cooperation with SEI and Grece</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2003
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
International Journal of Geographical Information Science
ISSN
1365-8816
e-ISSN
—
Volume of the periodical
17
Issue of the periodical within the volume
—
Country of publishing house
GB - UNITED KINGDOM
Number of pages
20
Pages from-to
119-138
UT code for WoS article
—
EID of the result in the Scopus database
—