Settling the bound on the rectilinear link radius of a simple rectilinear polygon

DOI10.1016/j.ipl.2010.11.007zbMath1260.68418OpenAlexW2052366888MaRDI QIDQ1944045

Matthew J. Katz, Gila Morgenstern

Publication date: 4 April 2013

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2010.11.007

zbMATH Keywords

combinatorial geometrycomputational geometryrectilinear link-distance

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

Computing the \(L_1\) geodesic diameter and center of a simple polygon in linear time

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On rectilinear link distance
• Computing the link center of a simple polygon
• An \(O(n\log n)\) algorithm for computing the link center of a simple polygon
• A Helly-type theorem for simple polygons
• An optimal algorithm for the rectilinear link center of a rectilinear polygon
• Generalized convex kernels of simply connected \(L_n\) sets in the plane
• GUARDING ORTHOGONAL ART GALLERIES WITH SLIDING CAMERAS
• LOGARITHMIC-TIME LINK PATH QUERIES IN A SIMPLE POLYGON

This page was built for publication: Settling the bound on the rectilinear link radius of a simple rectilinear polygon