On Some Distance Problems in Fixed Orientations
From MaRDI portal
Publication:3028355
Cited in
(37)- Computing the stretch factor and maximum detour of paths, trees, and cycles in the normed space
- Angle-restricted tours in the plane.
- Planar location problems with block distance and barriers
- The GeoSteiner software package for computing Steiner trees in the plane: an updated computational study
- \(L_ 1\) shortest paths among polygonal obstacles in the plane
- Applications of a numbering scheme for polygonal obstacles in the plane
- The Steiner tree problem in orientation metrics
- A single facility stochastic location problem under A-distance
- Robustness of \(k\)-gon Voronoi diagram construction
- The geometry of Minkowski spaces -- a survey. II.
- Kinetic Voronoi diagrams and Delaunay triangulations under polygonal distance functions
- Proximity problems for points on a rectilinear plane with rectangular obstacles
- ON CONNECTING RED AND BLUE RECTILINEAR POLYGONAL OBSTACLES WITH NONINTERSECTING MONOTONE RECTILINEAR PATHS
- Generalized halfspaces in restricted-orientation convexity
- Rectilinear paths among rectilinear obstacles
- Optimal curvature-constrained paths for general directional-cost functions
- Steiner minimal trees in rectilinear and octilinear planes
- Parallel rectilinear shortest paths with rectangular obstacles
- An algorithmic approach to some problems in terrain navigation
- Fastest-path planning for direction-dependent speed functions
- Shortest paths among transient obstacles
- Optimization on directionally convex sets
- Forbidden subpaths for Steiner minimum networks in uniform orientation metrics
- On the \(\mathcal{O}_\beta\)-hull of a planar point set
- Fundamentals of restricted-orientation convexity
- On geometric path query problems
- Computing \(L_1\) shortest paths among polygonal obstacles in the plane
- Locally minimal uniformly oriented shortest networks
- Tropical bisectors and Voronoi diagrams
- Minimum Manhattan network problem in normed planes with polygonal balls: a factor 2.5 approximation algorithm
- Rotationally optimal spanning and Steiner trees in uniform orientation metrics
- Robust Point-Location in Generalized Voronoi Diagrams
- A methodology for modelling travel distances by bias estimation
- Minimum-link paths revisited
- On graphs preserving rectilinear shortest paths in the presence of obstacles
- PLANAR STRONG VISIBILITY
- Steiner trees for fixed orientation metrics
This page was built for publication: On Some Distance Problems in Fixed Orientations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3028355)
