An algorithmic approach to some problems in terrain navigation
From MaRDI portal
Publication:1116366
DOI10.1016/0004-3702(88)90054-9zbMATH Open0665.68090OpenAlexW2085789363MaRDI QIDQ1116366FDOQ1116366
Publication date: 1988
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://hdl.handle.net/1813/8662
Recommendations
- scientific article; zbMATH DE number 1424303
- Shortest paths in the plane with convex polygonal obstacles
- Searching shortest paths on a set of geometric objects
- Generalizations of Naismith's problem: minimal transit time between two points in a heterogenous terrian
- Approximate shortest descending paths
Cites Work
- A note on two problems in connexion with graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimal Search in Planar Subdivisions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane
- Shortest watchman routes in simple polygons
- Euclidean shortest paths in the presence of rectilinear barriers
- The Discrete Geodesic Problem
- On Shortest Paths in Polyhedral Spaces
- Title not available (Why is that?)
- Optimal shortest path queries in a simple polygon
- On Some Distance Problems in Fixed Orientations
- Primitives for the manipulation of general subdivisions and the computation of Voronoi
- Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time
- Optimum watchman routes
- Title not available (Why is that?)
- Path-planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape
- Computational geometry in a curved world
- An algorithm for shortest-path motion in three dimensions
- Visibility of disjoint polygons
- An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon
- The power of geometric duality revisited
- Shortest path between two simple polygons
- Title not available (Why is that?)
- Optimal piecewise linear motion of an object among obstacles
- Rectilinear shortest paths in the presence of rectangular barriers
- Unobstructed shortest paths in polyhedral environments
- Title not available (Why is that?)
- A Method for Solving Arbitrary-Wall Mazes by Computer
Cited In (13)
- On fast planning of suboptimal paths amidst polygonal obstacles in plane
- Guarding curvilinear art galleries with vertex or point guards
- On approximating shortest paths in weighted triangular tessellations
- Guarding curvilinear art galleries with edge or mobile guards via 2-dominance of triangulation graphs
- Fast computation of weighted distance functions and geodesics on implicit hyper-surfaces
- A new algorithm for shortest paths among obstacles in the plane
- Quickest path queries on transportation network
- Title not available (Why is that?)
- Trajectory planning in \(H\)-space
- Linear Search with Terrain-Dependent Speeds
- Automatic target tracking on multi-resolution terrain
- Efficient piecewise-linear function approximation using the uniform metric
- Characterizing and recognizing weak visibility polygons
This page was built for publication: An algorithmic approach to some problems in terrain navigation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1116366)
