Add to ORKGThe point location problem is one of the most frequent tasks in computational geometry. The walking algorithms are one of the most popular solutions for finding an element in a mesh which contains a query point. Despite their suboptimal complexity, the walking algorithms are very popular because they do not require any additional memory and their implementation is simple
Path finding algorithms are part of artificial intelligence. First algorithms were presented in the ...
Let S be a data set of n points in R d, and ˆµ be a point in R d which “best ” describes S. Since th...
Moving objects are spatio-temporal data that change their location or shape continuously over time. ...
The point location problem is one of the most frequent tasks in computational geometry. The walking ...
Abstract—Finding which triangle in a planar triangular mesh contains a query point (so-called point ...
AbstractThe point location problem is one of the most frequent tasks in computational geometry. The ...
We present results on executing point location queries in well-shaped meshes in R2 and R3 using the ...
We consider algorithms for finding the optimal location of a simple transportation device, that we c...
AbstractWe consider algorithms for finding the optimal location of a simple transportation device, t...
In the field of Artificial Intelligence, calculating the best route from one point to another, known...
Vyhledávání takového trojúhelníku trojúhelníkové sítě, který obsahuje požadovaný bod (tzv. problém l...
We design, analyze, implement, and evaluate a distribution-sensitive point location algorithm based ...
Report on point location query on a planar straight line graph measuring processing time, space comp...
This paper is a study of application of persistent data structures to the planar and, in part, also ...
International audienceWe analyze, implement, and evaluate a distribution- sensitive point location a...
Path finding algorithms are part of artificial intelligence. First algorithms were presented in the ...
Let S be a data set of n points in R d, and ˆµ be a point in R d which “best ” describes S. Since th...
Moving objects are spatio-temporal data that change their location or shape continuously over time. ...
The point location problem is one of the most frequent tasks in computational geometry. The walking ...
Abstract—Finding which triangle in a planar triangular mesh contains a query point (so-called point ...
AbstractThe point location problem is one of the most frequent tasks in computational geometry. The ...
We present results on executing point location queries in well-shaped meshes in R2 and R3 using the ...
We consider algorithms for finding the optimal location of a simple transportation device, that we c...
AbstractWe consider algorithms for finding the optimal location of a simple transportation device, t...
In the field of Artificial Intelligence, calculating the best route from one point to another, known...
Vyhledávání takového trojúhelníku trojúhelníkové sítě, který obsahuje požadovaný bod (tzv. problém l...
We design, analyze, implement, and evaluate a distribution-sensitive point location algorithm based ...
Report on point location query on a planar straight line graph measuring processing time, space comp...
This paper is a study of application of persistent data structures to the planar and, in part, also ...
International audienceWe analyze, implement, and evaluate a distribution- sensitive point location a...
Path finding algorithms are part of artificial intelligence. First algorithms were presented in the ...
Let S be a data set of n points in R d, and ˆµ be a point in R d which “best ” describes S. Since th...
Moving objects are spatio-temporal data that change their location or shape continuously over time. ...