This HTML5 document contains 47 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
n8http://localhost/temp/predkladatel/
n16http://linked.opendata.cz/resource/domain/vavai/projekt/
n6http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n18http://linked.opendata.cz/resource/domain/vavai/subjekt/
n17http://linked.opendata.cz/ontology/domain/vavai/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n15http://bibframe.org/vocab/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
n19http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F49777513%3A23520%2F12%3A43915954%21RIV13-GA0-23520___/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n4http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n11http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n14http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n5http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n20http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n10http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n9http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F49777513%3A23520%2F12%3A43915954%21RIV13-GA0-23520___
rdf:type
skos:Concept n17:Vysledek
dcterms:description
Finding which triangle in a planar or 2.5D triangle mesh contains a query point (so-called point location problem) is a frequent task in geosciences, especially when working with triangulated irregular network models. Usually, a large number of point locations has to be performed, and so there is a need for fast algorithms having minimal additional memory requirements and resistant to changes in the triangulation. So-called walking algorithms offer low complexity, easy implementation, and negligible additional memory requirements, which makes them suitable for such applications. In this article, we focus on these algorithms, summarize, and compare them with regard to their use in geosciences. Since such a summary has not been done yet, our article should serve those who are dealing with this problem in their application to decide which algorithm would be the best for their solution. Moreover, the influence of the triangulation type on the number of the visited triangles is discussed. Finding which triangle in a planar or 2.5D triangle mesh contains a query point (so-called point location problem) is a frequent task in geosciences, especially when working with triangulated irregular network models. Usually, a large number of point locations has to be performed, and so there is a need for fast algorithms having minimal additional memory requirements and resistant to changes in the triangulation. So-called walking algorithms offer low complexity, easy implementation, and negligible additional memory requirements, which makes them suitable for such applications. In this article, we focus on these algorithms, summarize, and compare them with regard to their use in geosciences. Since such a summary has not been done yet, our article should serve those who are dealing with this problem in their application to decide which algorithm would be the best for their solution. Moreover, the influence of the triangulation type on the number of the visited triangles is discussed.
dcterms:title
Walking algorithms for point location in TIN models Walking algorithms for point location in TIN models
skos:prefLabel
Walking algorithms for point location in TIN models Walking algorithms for point location in TIN models
skos:notation
RIV/49777513:23520/12:43915954!RIV13-GA0-23520___
n17:predkladatel
n18:orjk%3A23520
n3:aktivita
n5:P n5:S
n3:aktivity
P(GA201/09/0097), P(GAP202/10/1435), S
n3:cisloPeriodika
4
n3:dodaniDat
n9:2013
n3:domaciTvurceVysledku
n6:9901159 n6:8321639 n6:4569334
n3:druhVysledku
n20:J
n3:duvernostUdaju
n11:S
n3:entitaPredkladatele
n19:predkladatel
n3:idSjednocenehoVysledku
180694
n3:idVysledku
RIV/49777513:23520/12:43915954
n3:jazykVysledku
n14:eng
n3:klicovaSlova
Point searching, Searching algorithms, Planar triangulation, TIN models, Terrain models
n3:klicoveSlovo
n4:Point%20searching n4:Terrain%20models n4:TIN%20models n4:Searching%20algorithms n4:Planar%20triangulation
n3:kodStatuVydavatele
NL - Nizozemsko
n3:kontrolniKodProRIV
[15C8D0D9ED43]
n3:nazevZdroje
Computational Geosciences
n3:obor
n10:IN
n3:pocetDomacichTvurcuVysledku
3
n3:pocetTvurcuVysledku
3
n3:projekt
n16:GAP202%2F10%2F1435 n16:GA201%2F09%2F0097
n3:rokUplatneniVysledku
n9:2012
n3:svazekPeriodika
16
n3:tvurceVysledku
Kolingerová, Ivana Málková, Martina Soukal, Roman
s:issn
1420-0597
s:numberOfPages
17
n15:doi
10.1007/s10596-012-9305-3
n8:organizacniJednotka
23520