Subtitle:

Raport Badawczy = Research Report ; RB/7/2008

Publisher:

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

Place of publishing:

Warszawa

Description:

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

Type of object:

Book/Chapter

Abstract:

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.

Relation:

Raport Badawczy = Research Report

Detailed Resource Type:

Report

Resource Identifier:

oai:rcin.org.pl:106323

Source:

RB-2008-07

Language:

eng

Language of abstract:

eng

Rights:

Creative Commons Attribution BY 4.0 license

Terms of use:

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: ; -

Digitizing institution:

Systems Research Institute of the Polish Academy of Sciences

Original in:

Library of Systems Research Institute PAS

Projects co-financed by:

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.

Access:

Open