An optimal algorithm for the rectilinear link center of a rectilinear polygon

DOI10.1016/0925-7721(95)00026-7zbMath0849.68128OpenAlexW2075041772MaRDI QIDQ1917052

Sven Schuierer, Bengt J. Nilsson

Publication date: 14 July 1996

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0925-7721(95)00026-7

zbMATH Keywords

link center

Mathematics Subject Classification ID

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

Related Items (5)

Rectilinear link diameter and radius in a rectilinear polygonal domain ⋮ Settling the bound on the rectilinear link radius of a simple rectilinear polygon ⋮ A linear-time algorithm for the geodesic center of a simple polygon ⋮ Rectilinear link diameter and radius in a rectilinear polygonal domain ⋮ Computing the \(L_1\) geodesic diameter and center of a simple polygon in linear time

Cites Work

• 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
• Optimal parallel algorithms for rectilinear link-distance problems

This page was built for publication: An optimal algorithm for the rectilinear link center of a rectilinear polygon