@misc{Gągolewski_Marek._Autor_Quad-walk_2008,
 author={Gągolewski, Marek. Autor},
 copyright={Creative Commons Attribution BY 4.0 license},
 address={Warszawa},
 journal={Raport Badawczy = Research Report},
 howpublished={online},
 year={2008},
 publisher={Instytut Badań Systemowych. Polska Akademia Nauk},
 publisher={Systems Research Institute. Polish Academy of Sciences},
 language={eng},
 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.},
 title={Quad-walk : a fast incremental Delaunay triangulation algorithm},
 type={Text},
 keywords={Computational geometry, Delaunay triangulation, Incremental algorithm, Quad-tree, Point location, Geometria obliczeniowa, Triangulacja delone(delaunay'a), Drzewo czwórkowe, Lokalizacja punktu},
}