<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet type="text/xsl" href="https://www.rcin.org.pl/style/common/xsl/oai-style.xsl"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/
         http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
	<responseDate>2026-04-16T19:52:26Z</responseDate>
	<request identifier="oai:rcin.org.pl:106323" metadataPrefix="oai_dc" verb="GetRecord">
	https://rcin.org.pl/oai-pmh-repository.xml</request>
	<GetRecord>
	
  <record>
	<header>
		<identifier>oai:rcin.org.pl:106323</identifier>
	    <datestamp>2020-10-08T16:34:28Z</datestamp>
		  <setSpec>rcin.org.pl:partnerCollections:ibsyst:report</setSpec> 	      <setSpec>rcin.org.pl</setSpec> 	      <setSpec>rcin.org.pl:partnerCollections:ibsyst:books</setSpec> 	      <setSpec>rcin.org.pl:partnerCollections:ibsyst</setSpec> 	      <setSpec>rcin.org.pl:literature</setSpec> 	      <setSpec>rcin.org.pl:literature:booksChapters</setSpec> 	      <setSpec>rcin.org.pl:partnerCollections</setSpec> 	    </header>
		<metadata>
	<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
<dc:title xml:lang="en"><![CDATA[Quad-walk : a fast incremental Delaunay triangulation algorithm]]></dc:title>
<dc:title xml:lang="en"><![CDATA[Raport Badawczy = Research Report ; RB/7/2008]]></dc:title>
<dc:title xml:lang="pl"><![CDATA[Quad-walk : a fast incremental Delaunay triangulation algorithm]]></dc:title>
<dc:title xml:lang="pl"><![CDATA[Raport Badawczy = Research Report ; RB/7/2008]]></dc:title>
<dc:creator><![CDATA[Gągolewski, Marek. Autor]]></dc:creator>
<dc:subject xml:lang="en"><![CDATA[Computational geometry]]></dc:subject>
<dc:subject xml:lang="en"><![CDATA[Delaunay triangulation]]></dc:subject>
<dc:subject xml:lang="en"><![CDATA[Incremental algorithm]]></dc:subject>
<dc:subject xml:lang="en"><![CDATA[Quad-tree]]></dc:subject>
<dc:subject xml:lang="en"><![CDATA[Point location]]></dc:subject>
<dc:subject xml:lang="en"><![CDATA[Geometria obliczeniowa]]></dc:subject>
<dc:subject xml:lang="en"><![CDATA[Triangulacja delone(delaunay'a)]]></dc:subject>
<dc:subject xml:lang="en"><![CDATA[Drzewo czwórkowe]]></dc:subject>
<dc:subject xml:lang="en"><![CDATA[Lokalizacja punktu]]></dc:subject>
<dc:subject xml:lang="pl"><![CDATA[Computational geometry]]></dc:subject>
<dc:subject xml:lang="pl"><![CDATA[Delaunay triangulation]]></dc:subject>
<dc:subject xml:lang="pl"><![CDATA[Incremental algorithm]]></dc:subject>
<dc:subject xml:lang="pl"><![CDATA[Quad-tree]]></dc:subject>
<dc:subject xml:lang="pl"><![CDATA[Point location]]></dc:subject>
<dc:subject xml:lang="pl"><![CDATA[Geometria obliczeniowa]]></dc:subject>
<dc:subject xml:lang="pl"><![CDATA[Triangulacja delone(delaunay'a)]]></dc:subject>
<dc:subject xml:lang="pl"><![CDATA[Drzewo czwórkowe]]></dc:subject>
<dc:subject xml:lang="pl"><![CDATA[Lokalizacja punktu]]></dc:subject>
<dc:description xml:lang="en"><![CDATA[20 pages : illustrations ; 21 cm]]></dc:description>
<dc:description xml:lang="en"><![CDATA[Bibliography p. 13-16]]></dc:description>
<dc:description xml:lang="en"><![CDATA[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.]]></dc:description>
<dc:description xml:lang="pl"><![CDATA[20 stron : ilustracje ; 21 cm]]></dc:description>
<dc:description xml:lang="pl"><![CDATA[Bibliografia s. 13-16]]></dc:description>
<dc:description xml:lang="pl"><![CDATA[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.]]></dc:description>
<dc:publisher><![CDATA[Instytut Badań Systemowych. Polska Akademia Nauk]]></dc:publisher>
<dc:publisher><![CDATA[Systems Research Institute. Polish Academy of Sciences]]></dc:publisher>
<dc:date><![CDATA[2008]]></dc:date>
<dc:type xml:lang="en"><![CDATA[Text]]></dc:type>
<dc:type xml:lang="pl"><![CDATA[Tekst]]></dc:type>
<dc:identifier><![CDATA[https://rcin.org.pl/dlibra/publication/113903/edition/106323/content]]></dc:identifier>
<dc:identifier><![CDATA[oai:rcin.org.pl:106323]]></dc:identifier>
<dc:source xml:lang="en"><![CDATA[RB-2008-07]]></dc:source>
<dc:source xml:lang="pl"><![CDATA[RB-2008-07]]></dc:source>
<dc:language><![CDATA[eng]]></dc:language>
<dc:relation><![CDATA[Raport Badawczy = Research Report]]></dc:relation>
<dc:relation><![CDATA[oai:rcin.org.pl:publication:113903]]></dc:relation>
<dc:rights xml:lang="en"><![CDATA[Creative Commons Attribution BY 4.0 license]]></dc:rights>
<dc:rights xml:lang="pl"><![CDATA[Licencja Creative Commons Uznanie autorstwa 4.0]]></dc:rights>
</oai_dc:dc>

</metadata>
	  </record>	</GetRecord>
</OAI-PMH>
