The stochastic walk algorithms for point location in pseudo-triangulations

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F11%3A43899306" target="_blank" >RIV/49777513:23520/11:43899306 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
The stochastic walk algorithms for point location in pseudo-triangulations
Original language description
A pseudo-triangulation is a planar subdivision into polygons with three convex vertices, useful for ray shooting, visibility problems and kinetic collision detection. In this paper, we address the question of location in pseudo-triangulations. We proposetwo location algorithms based on the so-called stochastic walk and present their experimental results. As far as we know, no walk algorithm specialized on pseudo-triangulations has been developed before.
Czech name
—
Czech description
—

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

Project
<a href="/en/project/GAP202%2F10%2F1435" target="_blank" >GAP202/10/1435: Analysis and Visualization of Protein Structures</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

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

Similar results(10)