| Title: | An almost distribution-independent incremental Delaunay triangulation algorithm |
|---|
| Authors: | ID Zadravec, Mirko (Author)
ID Žalik, Borut (Author) |
|---|
| Files: |  http://springerlink.metapress.com/media/3D325D0EWG7TTJF08EEQ/Contributions/G/1/8/7/G187315448L5Q387.pdf
|
|---|
| Language: | English |
|---|
| Work type: | Unknown |
|---|
| Typology: | 1.01 - Original Scientific Article |
|---|
| Organization: | FERI - Faculty of Electrical Engineering and Computer Science
|
|---|
| Abstract: | This paper presents a new incremental insertion algorithm for constructing a Delaunay triangulation. Firstly, the nearest point is found in order to speed up the location of a triangle containing a currently inserted point. A hash table and 1-3 deterministic skip lists, combined with a walking strategy, are used for this task. The obtained algorithm is compared with the most popular Delaunay triangulation algorithms. The algorithm has the following attractive features: it is fast and practically independent of the distribution of input points, it is not memory demanding, and it is numerically stable and easy to implement. |
|---|
| Keywords: | Delaunay triangulation, incremental algorithm, computational geometry, skip list, hash table |
|---|
| Year of publishing: | 2005 |
|---|
| PID: | 20.500.12556/DKUM-27042  |
|---|
| UDC: | 004.92 |
|---|
| ISSN on article: | 0178-2789 |
|---|
| COBISS.SI-ID: | 9766422 |
|---|
| NUK URN: | URN:SI:UM:DK:XXVEGTFR |
|---|
| Publication date in DKUM: | 01.06.2012 |
|---|
| Views: | 2632 |
|---|
| Downloads: | 115 |
|---|
| Metadata: |    |
|---|
| Categories: | Misc.
|
|---|
|
:
|
Copy citation |
|---|
| | | | Average score: | (0 votes) |
|---|
| Your score: | Voting is allowed only for logged in users. |
|---|
| Share: |  |
|---|
Hover the mouse pointer over a document title to show the abstract or click
on the title to get all document metadata. |
