On Some Distance Problems in Fixed Orientations
From MaRDI portal
Publication:3028355
DOI10.1137/0216049zbMath0625.68049OpenAlexW2146919520MaRDI QIDQ3028355
No author found.
Publication date: 1987
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0216049
VLSI designconvex polygonsVoronoi diagramcomputational geometryminimum spanning treeplanar distance problems
Related Items
Rotationally optimal spanning and Steiner trees in uniform orientation metrics, PLANAR STRONG VISIBILITY, Shortest paths among transient obstacles, Locally minimal uniformly oriented shortest networks, An algorithmic approach to some problems in terrain navigation, Fundamentals of restricted-orientation convexity, Fastest-path planning for direction-dependent speed functions, The Steiner tree problem in orientation metrics, Computing \(L_1\) shortest paths among polygonal obstacles in the plane, On geometric path query problems, Optimal curvature-constrained paths for general directional-cost functions, Minimum Manhattan network problem in normed planes with polygonal balls: a factor 2.5 approximation algorithm, On the \(\mathcal{O}_\beta\)-hull of a planar point set, Kinetic Voronoi diagrams and Delaunay triangulations under polygonal distance functions, Minimum-link paths revisited, On graphs preserving rectilinear shortest paths in the presence of obstacles, Steiner minimal trees in rectilinear and octilinear planes, 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, Proximity problems for points on a rectilinear plane with rectangular obstacles, Parallel rectilinear shortest paths with rectangular obstacles, COMPUTING THE STRETCH FACTOR AND MAXIMUM DETOUR OF PATHS, TREES, AND CYCLES IN THE NORMED SPACE, Angle-restricted tours in the plane., ON CONNECTING RED AND BLUE RECTILINEAR POLYGONAL OBSTACLES WITH NONINTERSECTING MONOTONE RECTILINEAR PATHS, Robust Point-Location in Generalized Voronoi Diagrams, Generalized halfspaces in restricted-orientation convexity, Optimization on directionally convex sets, Steiner trees for fixed orientation metrics, A methodology for modelling travel distances by bias estimation, Rectilinear paths among rectilinear obstacles, Robustness of \(k\)-gon Voronoi diagram construction, The geometry of Minkowski spaces -- a survey. II., Tropical bisectors and Voronoi diagrams, A single facility stochastic location problem under A-distance, Forbidden subpaths for Steiner minimum networks in uniform orientation metrics, Planar location problems with block distance and barriers
