Walking algorithms for point location in TIN models

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F12%3A43915954" target="_blank" >RIV/49777513:23520/12:43915954 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/s10596-012-9305-3" target="_blank" >http://dx.doi.org/10.1007/s10596-012-9305-3</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s10596-012-9305-3" target="_blank" >10.1007/s10596-012-9305-3</a>

Result language
angličtina
Original language name
Walking algorithms for point location in TIN models
Original language 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.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—

Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

Publication year
2012
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)