Euclidean shortest paths in the presence of rectilinear barriers
From MaRDI portal
Publication:3337244
DOI10.1002/net.3230140304zbMath0545.90098WikidataQ30047557 ScholiaQ30047557MaRDI QIDQ3337244
No author found.
Publication date: 1984
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230140304
visibility graph; Euclidean shortest path; shortest-path tree; planar algorithms; rectilinear barriers
90C35: Programming involving graphs or networks
68Q25: Analysis of algorithms and problem complexity
05C35: Extremal problems in graph theory
Related Items
k-PAIRS NON-CROSSING SHORTEST PATHS IN A SIMPLE POLYGON, POINT VISIBILITY GRAPHS AND ${\mathcal O}$-CONVEX COVER, OPTIMAL POLYGON COVER PROBLEMS AND APPLICATIONS, SMOOTHING IMPRECISE 1.5D TERRAINS, GUARDING ART GALLERIES BY GUARDING WITNESSES, Computing the geodesic center of a simple polygon, Computing the external geodesic diameter of a simple polygon, Fastest path across constrained moving rectilinear obstacles, Shortest polygonal paths in space, An optimal algorithm for computing a minimum nested nonconvex polygon, Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time, Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time, Visibility of disjoint polygons, Visibility between two edges of a simple polygon, Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons, Minimum polygonal separation, Computing the link center of a simple polygon, Parallel algorithms for shortest path problems in polygons, Shortest path between two simple polygons, Rectilinear shortest paths in the presence of rectangular barriers, On the geodesic Voronoi diagram of point sites in a simple polygon, An algorithmic approach to some problems in terrain navigation, Topologically sweeping an arrangement, A survey of motion planning and related geometric algorithms, Computing external farthest neighbors for a simple polygon, \(L_ 1\) shortest paths among polygonal obstacles in the plane, Parallel rectilinear shortest paths with rectangular obstacles, The application of \(\psi\)-transform for determining a near-optimal path in the presence of polyhedral obstacles, Parallel methods for visibility and shortest-path problems in simple polygons, The furthest-site geodesic Voronoi diagram, Shortest curves in planar regions with curved boundary, Computing minimum length paths of a given homotopy class, Ray shooting in polygons using geodesic triangulations, A new algorithm for shortest paths among obstacles in the plane, Removing edge-node intersections in drawings of graphs, Voronoi diagrams with barriers and on polyhedra for minimal path planning, Computing geodesic furthest neighbors in simple polygons, Optimal shortest path queries in a simple polygon, On separating two simple polygons by a single translation, Characterizing and recognizing the visibility graph of a funnel-shaped polygon, Negative results on characterizing visibility graphs, Efficient piecewise-linear function approximation using the uniform metric, Minimal link visibility paths inside a simple polygon, Computing homotopic shortest paths efficiently, Approximate convex decomposition of polygons, Rectilinear paths among rectilinear obstacles, Some Computational Aspects of Geodesic Convex Sets in a Simple Polygon, Algorithms for Computing Diffuse Reflection Paths in Polygons, Visibility graphs and obstacle-avoiding shortest paths
