Hybrid Walking Point Location Algorithm
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F11%3A43897719" target="_blank" >RIV/49777513:23520/11:43897719 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Hybrid Walking Point Location Algorithm
Original language description
Finding which triangle in a planar triangular mesh contains a query point (so-called point location problem) is one of the most frequent tasks in computational geometry. In this paper, we propose a new walking algorithm combining two existing approachesto provide speed, robustness and easy implementation, and compare it with the fastest representatives of walking algorithms. Experiments proved that our algorithm is faster than the fastest existing visibility and straight walk algorithms, and dependingon the character of input data, either as fast as the orthogonal walk algorithms or faster.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GA201%2F09%2F0097" target="_blank" >GA201/09/0097: Triangulated models in service of haptic and virtual reality</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach
Others
Publication year
2011
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
ADVCOMP 2011
ISBN
978-1-61208-172-4
ISSN
—
e-ISSN
—
Number of pages
5
Pages from-to
7-11
Publisher name
IARIA
Place of publication
Lisbon
Event location
Lisbon, Portugal
Event date
Nov 20, 2011
Type of event by nationality
EUR - Evropská akce
UT code for WoS article
—