Inny tytuł:

Raport Badawczy = Research Report ; RB/7/2008

Wydawca:

Instytut Badań Systemowych. Polska Akademia Nauk ; Systems Research Institute. Polish Academy of Sciences

Miejsce wydania:

Warszawa

Opis:

20 pages : illustrations ; 21 cm ; Bibliography p. 13-16

Typ obiektu:

Book/Chapter

Abstrakt:

This paper presents a new incremental insertion algorithm for constructing a De­launay triangulation in 2D. The domain is partitioned into rectangular regions or­ganized 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.

Czasopismo/Seria/cykl:

Raport Badawczy = Research Report

Szczegółowy typ zasobu:

Report

Identyfikator zasobu:

oai:rcin.org.pl:106323

Źródło:

RB-2008-07

Język:

eng

Język streszczenia:

eng

Prawa:

Creative Commons Attribution BY 4.0 license

Zasady wykorzystania:

Copyright-protected material. [CC BY 4.0] May be used within the scope specified in Creative Commons Attribution BY 4.0 license, full text available at: ; -

Digitalizacja:

Systems Research Institute of the Polish Academy of Sciences

Lokalizacja oryginału:

Library of Systems Research Institute PAS

Dofinansowane ze środków:

Operational Program Digital Poland, 2014-2020, Measure 2.3: Digital accessibility and usefulness of public sector information; funds from the European Regional Development Fund and national co-financing from the state budget.

Dostęp:

Open