Settling the bound on the rectilinear link radius of a simple rectilinear polygon
type: Item
instance of: scholarly article
title: Settling the bound on the rectilinear link radius of a simple rectilinear polygon
zbMATH Open document ID: 1260.68418
author: Matthew J. Katz
author: Gila Morgenstern
published in: Information Processing Letters
publication date: 2013-04-04T00:00:00Z
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 6150235
zbMATH Keywords: computational geometry
zbMATH Keywords: combinatorial geometry
zbMATH Keywords: rectilinear link-distance
MaRDI profile type: Publication
full work available at URL: j.ipl.2010.11.007
OpenAlex ID: W2052366888
cites work: LOGARITHMIC-TIME LINK PATH QUERIES IN A SIMPLE POLYGON
cites work: A Helly-type theorem for simple polygons
cites work: On rectilinear link distance
cites work: An \(O(n\log n)\) algorithm for computing the link center of a simple polygon
cites work: Q4037425
cites work: GUARDING ORTHOGONAL ART GALLERIES WITH SLIDING CAMERAS
cites work: Computing the link center of a simple polygon
cites work: Generalized convex kernels of simply connected \(L_n\) sets in the plane
cites work: Q4945513
cites work: Q4035759
cites work: An optimal algorithm for the rectilinear link center of a rectilinear polygon
DOI: 10.1016/J.IPL.2010.11.007
Recommended article: Rectilinear link diameter and radius in a rectilinear polygonal domain
Recommended article: Q4035759
Recommended article: Asymptotics of linked polygons
Recommended article: An optimal algorithm for the rectilinear link center of a rectilinear polygon
Recommended article: Q4037424
Recommended article: Computing and Combinatorics
Recommended article: Q3217600
Recommended article: On the area of a polygonal linkage
Recommended article: An almost optimal bound on the number of intersections of two simple polygons
description: scientific article; zbMATH DE number 6150235