| Naslov: | An almost distribution-independent incremental Delaunay triangulation algorithm |
|---|
| Avtorji: | ID Zadravec, Mirko (Avtor)
ID Žalik, Borut (Avtor) |
|---|
| Datoteke: |  http://springerlink.metapress.com/media/3D325D0EWG7TTJF08EEQ/Contributions/G/1/8/7/G187315448L5Q387.pdf
|
|---|
| Jezik: | Angleški jezik |
|---|
| Vrsta gradiva: | Neznano |
|---|
| Tipologija: | 1.01 - Izvirni znanstveni članek |
|---|
| Organizacija: | FERI - Fakulteta za elektrotehniko, računalništvo in informatiko
|
|---|
| Opis: | 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. |
|---|
| Ključne besede: | Delaunay triangulation, incremental algorithm, computational geometry, skip list, hash table |
|---|
| Leto izida: | 2005 |
|---|
| PID: | 20.500.12556/DKUM-27042  |
|---|
| UDK: | 004.92 |
|---|
| COBISS.SI-ID: | 9766422 |
|---|
| ISSN pri članku: | 0178-2789 |
|---|
| NUK URN: | URN:SI:UM:DK:XXVEGTFR |
|---|
| Datum objave v DKUM: | 01.06.2012 |
|---|
| Število ogledov: | 2630 |
|---|
| Število prenosov: | 115 |
|---|
| Metapodatki: |    |
|---|
| Področja: | Ostalo
|
|---|
|
:
|
Kopiraj citat |
|---|
| | | | Skupna ocena: | (0 glasov) |
|---|
| Vaša ocena: | Ocenjevanje je dovoljeno samo prijavljenim uporabnikom. |
|---|
| Objavi na: |  |
|---|
Postavite miškin kazalec na naslov za izpis povzetka. Klik na naslov izpiše
podrobnosti ali sproži prenos. |
