Minimum-link paths revisited
From MaRDI portal
Publication:2450201
DOI10.1016/j.comgeo.2013.12.005zbMath1290.65016arXiv1302.3091OpenAlexW1990187919MaRDI QIDQ2450201
Joseph S. B. Mitchell, Mikko Sysikaski, Valentin Polishchuk
Publication date: 19 May 2014
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1302.3091
Related Items
Minimum-link shortest paths for polygons amidst rectilinear obstacles, Structured discrete shape approximation: theoretical complexity and practical algorithm, Rectilinear link diameter and radius in a rectilinear polygonal domain, Unnamed Item, Minimum-link \(C\)-oriented paths visiting a sequence of regions in the plane, Shortcut hulls: vertex-restricted outer simplifications of polygons, Cutting polygons into small pieces with chords: Laser-based localization, An optimal algorithm for minimum-link rectilinear paths in triangulated rectilinear domains, Rectilinear link diameter and radius in a rectilinear polygonal domain, Bicriteria rectilinear shortest paths among rectilinear obstacles in the plane, GEODESIC-PRESERVING POLYGON SIMPLIFICATION
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Simple proofs of classical theorems in discrete geometry via the Guth-Katz polynomial partitioning technique
- On rectilinear link distance
- Minimum-link paths among obstacles in the plane
- On the bit complexity of minimum link paths: Superquadratic algorithms for problem solvable in linear time
- Computing minimum length paths of a given homotopy class
- Ray shooting in polygons using geodesic triangulations
- Optimal computation of finitely oriented convex hulls
- Quasi-optimal range searching in spaces of finite VC-dimension
- On a class of \(O(n^ 2)\) problems in computational geometry
- Rectilinear paths among rectilinear obstacles
- A linear time algorithm for minimum link paths inside a simple polygon
- On Some Distance Problems in Fixed Orientations
- On approximate halfspace range counting and relative epsilon-approximations
- Efficient Algorithms for Geometric Graph Search Problems
- Dynamic orthogonal segment intersection search
- New algorithms for special cases of the hidden line elimination problem
- ON BENDS AND LENGTHS OF RECTILINEAR PATHS: A GRAPH-THEORETIC APPROACH
- MINIMUM-LINK C-ORIENTED PATHS: SINGLE-SOURCE QUERIES
- On bends and distances of paths among obstacles in two-layer interconnection model
- A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk
- Rectilinear Path Problems among Rectilinear Obstacles Revisited
- Faster Algorithms for Minimum-Link Paths with Restricted Orientations
- Computing the visibility polygon from a convex set and related problems
- Geometric discrepancy. An illustrated guide
