About: Walking algorithms for point location in TIN models

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Walking algorithms for point location in TIN models Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
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. (en)
Title	Walking algorithms for point location in TIN models Walking algorithms for point location in TIN models (en)
skos:prefLabel	Walking algorithms for point location in TIN models Walking algorithms for point location in TIN models (en)
skos:notation	RIV/49777513:23520/12:43915954!RIV13-GA0-23520___
http://linked.open...avai/predkladatel	Fakulta aplikovaných věd
http://linked.open...avai/riv/aktivita	P S
http://linked.open...avai/riv/aktivity	P(GA201/09/0097), P(GAP202/10/1435), S
http://linked.open...iv/cisloPeriodika	4
http://linked.open...vai/riv/dodaniDat	2013
http://linked.open...aciTvurceVysledku	Kolingerová, Ivana Málková, Martina Soukal, Roman
http://linked.open.../riv/druhVysledku	J - Článek v odborném periodiku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Západočeská univerzita v Plzni / Fakulta aplikovaných věd
http://linked.open...dnocenehoVysledku	180694
http://linked.open...ai/riv/idVysledku	RIV/49777513:23520/12:43915954
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	Point searching, Searching algorithms, Planar triangulation, TIN models, Terrain models (en)
http://linked.open.../riv/klicoveSlovo	Planar triangulation Point searching Searching algorithms TIN models Terrain models
http://linked.open...odStatuVydavatele	NL - Nizozemsko
http://linked.open...ontrolniKodProRIV	[15C8D0D9ED43]
http://linked.open...i/riv/nazevZdroje	Computational Geosciences
http://linked.open...in/vavai/riv/obor	IN
http://linked.open...ichTvurcuVysledku	3 (xsd:int)
http://linked.open...cetTvurcuVysledku	3 (xsd:int)
http://linked.open...vavai/riv/projekt	Triangulated models in service of haptic and virtual reality Analysis and Visualization of Protein Structures
http://linked.open...UplatneniVysledku	2012
http://linked.open...v/svazekPeriodika	16
http://linked.open...iv/tvurceVysledku	Kolingerová, Ivana Málková, Martina Soukal, Roman
issn	1420-0597
number of pages	17 (xsd:int)
http://bibframe.org/vocab/doi	10.1007/s10596-012-9305-3
http://localhost/t...ganizacniJednotka	23520
is http://linked.open...avai/riv/vysledek of	Walking algorithms for point location in TIN models

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 9 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software