<?xml version="1.0"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:dc="http://purl.org/dc/elements/1.1/"><rdf:Description rdf:about="https://dk.um.si/IzpisGradiva.php?id=27042"><dc:title>An almost distribution-independent incremental Delaunay triangulation algorithm</dc:title><dc:creator>Zadravec,	Mirko	(Avtor)
	</dc:creator><dc:creator>Žalik,	Borut	(Avtor)
	</dc:creator><dc:subject>Delaunay triangulation</dc:subject><dc:subject>incremental algorithm</dc:subject><dc:subject>computational geometry</dc:subject><dc:subject>skip list</dc:subject><dc:subject>hash table</dc:subject><dc:description>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.</dc:description><dc:date>2005</dc:date><dc:date>2012-06-01 09:41:43</dc:date><dc:type>Neznano</dc:type><dc:identifier>27042</dc:identifier><dc:language>sl</dc:language></rdf:Description></rdf:RDF>