An algorithmic approach to some problems in terrain navigation
From MaRDI portal
Publication:1116366
DOI10.1016/0004-3702(88)90054-9zbMath0665.68090OpenAlexW2085789363MaRDI QIDQ1116366
Publication date: 1988
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://hdl.handle.net/1813/8662
Related Items
Trajectory planning in \(H\)-space, A new algorithm for shortest paths among obstacles in the plane, Efficient piecewise-linear function approximation using the uniform metric, On fast planning of suboptimal paths amidst polygonal obstacles in plane, Guarding curvilinear art galleries with vertex or point guards, Characterizing and recognizing weak visibility polygons, Quickest path queries on transportation network, Guarding curvilinear art galleries with edge or mobile guards via 2-dominance of triangulation graphs, On approximating shortest paths in weighted triangular tessellations, Fast computation of weighted distance functions and geodesics on implicit hyper-surfaces
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- Shortest watchman routes in simple polygons
- Computational geometry in a curved world
- Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time
- The power of geometric duality revisited
- An algorithm for shortest-path motion in three dimensions
- Visibility of disjoint polygons
- Optimal piecewise linear motion of an object among obstacles
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- Path-planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape
- Unobstructed shortest paths in polyhedral environments
- Optimum watchman routes
- Shortest path between two simple polygons
- Rectilinear shortest paths in the presence of rectangular barriers
- An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane
- Optimal shortest path queries in a simple polygon
- On Some Distance Problems in Fixed Orientations
- The Discrete Geodesic Problem
- Euclidean shortest paths in the presence of rectilinear barriers
- Primitives for the manipulation of general subdivisions and the computation of Voronoi
- On Shortest Paths in Polyhedral Spaces
- An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon
- Optimal Search in Planar Subdivisions
- A Method for Solving Arbitrary-Wall Mazes by Computer
