Euclidean shortest paths in the presence of rectilinear barriers
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 3845073
- Rectilinear shortest paths in the presence of rectangular barriers
- SHORTEST PATHS AMONG OBSTACLES IN THE PLANE
- Shortest paths in the plane with convex polygonal obstacles
- Finding shortest paths in the plane in the presence of barriers to travel (for any \(l_ p\)-norm)
Cited in
(only showing first 100 items - show all)- Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time
- Finding shortest paths in the plane in the presence of barriers to travel (for any \(l_ p\)-norm)
- 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
- On graphs preserving rectilinear shortest paths in the presence of obstacles
- \(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
- Voronoi game on polygons
- Optimal placement of base stations in border surveillance using limited capacity drones
- Shortest paths among transient obstacles
- Shortest paths in the plane with obstacle violations
- Shortest paths and convex hulls in 2D complexes with non-positive curvature
- Largest triangle inside a terrain
- Visibility and ray shooting queries in polygonal domains
- Most vital segment barriers
- Minimal link visibility paths inside a simple polygon
- Computation of arc length in the presence of barriers in networks
- Computing homotopic shortest paths efficiently
- Approximate convex decomposition of polygons
- Rectilinear paths among rectilinear obstacles
- Finding globally shortest paths through a sequence of adjacent triangles by the method of orienting curves
- ALGORITHMS FOR DISTANCE PROBLEMS IN PLANAR COMPLEXES OF GLOBAL NONPOSITIVE CURVATURE
- Existence and computation of tours through imprecise points
- Maximising the worth of nascent networks
- Euclidean shortest paths. Exact or approximate algorithms.
- Finding a manhattan path and related problems
- scientific article; zbMATH DE number 3845073 (Why is no real title available?)
- CUTTING OUT POLYGONS WITH A CIRCULAR SAW
- Some computational aspects of geodesic convex sets in a simple polygon
- Algorithms for Computing Diffuse Reflection Paths in Polygons
- Application of the A^* algorithm to problems of the Euclidean shortest paths in the plane with polygonal obstacles
- Visibility graphs and obstacle-avoiding shortest paths
- Euclidean shortest path in the presence of obstacles
- On bends and distances of paths among obstacles in two-layer interconnection model
- Finding shortest paths in a sequence of triangles in 3D by the planar unfolding
- Finding shortest paths in a sequence of triangles in 3D by the method of orienting curves
- k-PAIRS NON-CROSSING SHORTEST PATHS IN A SIMPLE POLYGON
- POINT VISIBILITY GRAPHS AND ${\mathcal O}$-CONVEX COVER
- Relative convex hulls in semi-dynamic arrangements
- OPTIMAL POLYGON COVER PROBLEMS AND APPLICATIONS
- SMOOTHING IMPRECISE 1.5D TERRAINS
- Drawing Shortest Paths in Geodetic Graphs
- Spatial Distribution of Traffic Flow in a Rectangular City with a Grid Network and a Rectangular Barrier
- Drawing Shortest Paths in Geodetic Graphs
- Translating polygons with applications to hidden surface removal
- Finding shortest paths in the presence of orthogonal obstacles using a combined L 1 and link metric
- Shortest paths in the plane with obstacle violations
- An optimal algorithm to compute the inverse beacon attraction region
- scientific article; zbMATH DE number 7151640 (Why is no real title available?)
- GUARDING ART GALLERIES BY GUARDING WITNESSES
- Computing the geodesic center of a simple polygon
- Computing the external geodesic diameter of a simple polygon
- Tracing compressed curves in triangulated surfaces
- Euclidean TSP in narrow strips
- Inserting Multiple Edges into a Planar Graph
- Voronoi games using geodesics
- Efficient computation of the geodesic Voronoi diagram of points in a simple polygon
- scientific article; zbMATH DE number 7685241 (Why is no real title available?)
- Approximating the smallest \(k\)-enclosing geodesic disc in a simple polygon
- Maximal distortion of geodesic diameters in polygonal domains
- Voronoi diagrams in the moscow metric
- k-pairs non-crossing shortest paths in a simple polygon
- Dynamic maintenance of shortest path trees in simple polygons
- Approximation algorithms for the two-watchman route in a simple polygon
- Blaschke-type theorem and separation of disjoint closed geodesic convex sets
- Multiple shooting approach for finding approximately shortest paths for autonomous robots in unknown environments in 2D
- Constant workspace algorithms for computing relative hulls in the plane
- The geodesic edge center of a simple polygon
- A divide-and-conquer based preprocessing for routing in a simple polygon
- A new algorithm for Euclidean shortest paths in the plane
- A linear-time algorithm for the geodesic center of a simple polygon
- Mend the gap: a smart repair algorithm for noisy polygonal tilings
- Vertex-colored encompassing graphs
This page was built for publication: Euclidean shortest paths in the presence of rectilinear barriers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3337244)
