Star-shaped polyhedron point location with orthogonal walk algorithm

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F10%3A00504230" target="_blank" >RIV/49777513:23520/10:00504230 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Star-shaped polyhedron point location with orthogonal walk algorithm

Original language description

This paper describes the modifications of two walking algorithms for point location on a surface of a star-shaped polyhedron, a generalization of the Remembering Stochastic walk algorithm for a star-shaped polyhedron and a modification of the planar Orthogonal walk algorithm. The latter uses spherical coordinates to transfer the spatial point location problem to the planar point location problem. This way, the problem can be solved by the traditional planar algorithms. Along with the modifications, thepaper proposes new methods for finding a proper starting triangle for the walking process with or without preprocessing.

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

JC - Computer hardware and software

OECD FORD branch

—

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

S - Specificky vyzkum na vysokych skolach

Publication year

2010

Confidentiality

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

Name of the periodical

Procedia Computer Science

ISSN

1877-0509

e-ISSN

—

Volume of the periodical

1

Issue of the periodical within the volume

1

Country of publishing house

NL - THE KINGDOM OF THE NETHERLANDS

Number of pages

10

Pages from-to

—

UT code for WoS article

000281951600024

EID of the result in the Scopus database

—