On rectilinear link distance
From MaRDI portal
Publication:808302
DOI10.1016/0925-7721(91)90010-CzbMATH Open0731.68094OpenAlexW2113370909MaRDI QIDQ808302FDOQ808302
Authors: Mark de Berg 
Publication date: 1991
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0925-7721(91)90010-c
Recommendations
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Optimal Search in Planar Subdivisions
- Fast Algorithms for Finding Nearest Common Ancestors
- Optimal Point Location in a Monotone Subdivision
- Title not available (Why is that?)
- Finding minimum rectilinear distance paths in the presence of barriers
- Computing the link center of a simple polygon
- Rectilinear shortest paths in the presence of rectangular barriers
- An \(O(n \log n)\) algorithm for computing a link center in a simple polygon
Cited In (22)
- Linear-size planar Manhattan network for convex point sets
- Rectilinear link diameter and radius in a rectilinear polygonal domain
- An optimal algorithm for constructing an optimal bridge between two simple rectilinear polygons
- Minimum-link paths revisited
- Computing minimum length paths of a given homotopy class
- Guarding orthogonal art galleries with sliding cameras
- LOGARITHMIC-TIME LINK PATH QUERIES IN A SIMPLE POLYGON
- Title not available (Why is that?)
- An optimal algorithm for minimum-link rectilinear paths in triangulated rectilinear domains
- Bicriteria rectilinear shortest paths among rectilinear obstacles in the plane
- Title not available (Why is that?)
- On condorcet and median points of simple rectilinear polygons
- SHORTEST PATH QUERIES IN RECTILINEAR WORLDS
- Computing a maxian point of a simple rectilinear polygon
- Approximate guarding of monotone and rectilinear polygons
- Computing a median point of a simple rectilinear polygon
- An optimal algorithm for the rectilinear link center of a rectilinear polygon
- Rectilinear paths among rectilinear obstacles
- Settling the bound on the rectilinear link radius of a simple rectilinear polygon
- Optimal parallel algorithms for rectilinear link-distance problems
- On finding a shortest isothetic path and its monotonicity inside a digital object
- A multifacility location problem on median spaces
This page was built for publication: On rectilinear link distance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q808302)
