Point Location in Well-Shaped Meshes Using Jump-and-Walk
نویسندگان
چکیده
We present results on executing point location queries in well-shaped meshes in R and R using the Jumpand-Walk paradigm. If the jump step is performed on a nearest-neighbour search structure built on the vertices of the mesh, we demonstrate that the walk step can be performed in guaranteed constant time. Constant time for the walk step holds even if the jump step starts with an approximate nearest neighbour.
منابع مشابه
External Memory Algorithms For Path Traversal in Graphs
This thesis will present a number of results related to path traversal in trees and graphs. In particular, we focus on data structures which allow such traversals to be performed efficiently in the external memory setting. In addition, for trees and planar graphs the data structures we present are succinct. Our tree structures permit efficient bottom-up path traversal in rooted trees of arbitra...
متن کاملSimple and Efficient Distribution-Sensitive Point Location, in Triangulations
We analyze, implement, and evaluate a distributionsensitive point location algorithm based on the classical Jump & Walk, called Keep, Jump, & Walk. For a batch of query points, the main idea is to use previous queries to improve the current one. In practice, Keep, Jump, & Walk is actually a very competitive method to locate points in a triangulation. Regarding point location in a Delaunay trian...
متن کاملExtensible Point Location Algorithm
We present a general walk-through point location algorithm for use with general polyhedron lattices and polygonal meshes assuming the usage of nothing more than a simple linked list as a data structure to store the polyhedra. The generality of the approach stems from using barycentric coordinates to extract local information about the location of the query point that allows a ‘gradient descent’...
متن کاملSelf-Adapting Point Location
Point location in spatial subdivision is one of the most studied problems in computational geometry. In the case of triangulations of Rd, we revisit the problem to exploit a possible coherence between the query-points. For a single query, walking in the triangulation is a classical strategy with good practical behavior and expected complexity O(n1/d) if the points are evenly distributed. Based ...
متن کاملExpected time analysis for Delaunay point location
Abstract. We consider point location in Delaunay triangulations with the aid of simple data structures. In particular, we analyze methods in which a simple data structure is used to first locate a point close to the query point. For points uniformly distributed on the unit square, we show that the expected point location complexities are Θ( √ n) for the Green-Sibson rectilinear search, Θ(n) for...
متن کامل