On rectilinear link distance

DOI10.1016/0925-7721(91)90010-CMaRDI QIDQ808302zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

motion planninglink distancerectilinear polygonpolygon cutting theoremrectilinear paths

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• AN OPTIMAL DATA STRUCTURE FOR SHORTEST RECTILINEAR PATH QUERIES IN A SIMPLE RECTILINEAR POLYGON
• scientific article; zbMATH DE number 512835
• scientific article; zbMATH DE number 742973
• scientific article; zbMATH DE number 176583
• Rectilinear link diameter and radius in a rectilinear polygonal domain

Cites work

• scientific article; zbMATH DE number 3449757 (Why is no real title available?)
• An \(O(n \log n)\) algorithm for computing a link center in a simple polygon
• Computing the link center of a simple polygon
• Fast Algorithms for Finding Nearest Common Ancestors
• Finding minimum rectilinear distance paths in the presence of barriers
• Optimal Point Location in a Monotone Subdivision
• Optimal Search in Planar Subdivisions
• Rectilinear shortest paths in the presence of rectangular barriers

Cited in

(22)

• Rectilinear link diameter and radius in a rectilinear polygonal domain
• Computing minimum length paths of a given homotopy class
• scientific article; zbMATH DE number 1424300 (Why is no real title available?)
• Guarding orthogonal art galleries with sliding cameras
• LOGARITHMIC-TIME LINK PATH QUERIES IN A SIMPLE POLYGON
• On condorcet and median points of simple rectilinear polygons
• Approximate guarding of monotone and rectilinear polygons
• A multifacility location problem on median spaces
• Linear-size planar Manhattan network for convex point sets
• Rectilinear link diameter and radius in a rectilinear polygonal domain
• Rectilinear paths among rectilinear obstacles
• An optimal algorithm for the rectilinear link center of a rectilinear polygon
• Computing a maxian point of a simple rectilinear polygon
• An optimal algorithm for constructing an optimal bridge between two simple rectilinear polygons
• Settling the bound on the rectilinear link radius of a simple rectilinear polygon
• SHORTEST PATH QUERIES IN RECTILINEAR WORLDS
• On finding a shortest isothetic path and its monotonicity inside a digital object
• scientific article; zbMATH DE number 176583 (Why is no real title available?)
• Bicriteria rectilinear shortest paths among rectilinear obstacles in the plane
• Computing a median point of a simple rectilinear polygon
• Minimum-link paths revisited
• Optimal parallel algorithms for rectilinear link-distance problems

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)