Metadata language
Quad-walk : a fast incremental Delaunay triangulation algorithm
Subtitle:Raport Badawczy = Research Report ; RB/7/2008
Creator: Publisher:Instytut Badań Systemowych. Polska Akademia Nauk ; Systems Research Institute. Polish Academy of Sciences
Place of publishing: Date issued/created: Description:20 stron : ilustracje ; 21 cm ; Bibliografia s. 13-16
Type of object: Subject and Keywords:Computational geometry ; Delaunay triangulation ; Incremental algorithm ; Quad-tree ; Point location ; Geometria obliczeniowa ; Triangulacja delone(delaunay'a) ; Drzewo czwórkowe ; Lokalizacja punktu
Abstract:This paper presents a new incremental insertion algorithm for constructing a Delaunay triangulation in 2D. The domain is partitioned into rectangular regions organized into an adaptive quad-tree. This data structure is used to locate a triangle lying possibly the nearest to currently inserted point. To find the triangle containing the point, a walk from selected triangle in the direction of the point is conducted. The algorithm is empirically compared with other popular Delaunay triangulation methods. It is very fast, numerically stable and not memory demanding.
Relation:Raport Badawczy = Research Report
Resource type: Detailed Resource Type: Source: Language: Language of abstract: Rights:Licencja Creative Commons Uznanie autorstwa 4.0
Terms of use:Zasób chroniony prawem autorskim. [CC BY 4.0 Międzynarodowe] Korzystanie dozwolone zgodnie z licencją Creative Commons Uznanie autorstwa 4.0, której pełne postanowienia dostępne są pod adresem: ; -
Digitizing institution:Instytut Badań Systemowych Polskiej Akademii Nauk
Original in:Biblioteka Instytutu Badań Systemowych PAN
Projects co-financed by: Access:This content is hosted outside the digital library.
Click the link below to view the content.
https://www.ibspan.waw.pl/~alex/OZwRCIN/WA777_113903_RB-2008-07_Quad-walk : a fast incremental Delaunay triangulation algorithm_content.pdf