scientific article; zbMATH DE number 177553

MaRDI QIDQ4037424zbMATH OpenFDO

Authors Bengt J. Nilsson, Sven Schuierer

Publication date 18 May 1993

zbMATH Keywords

linear time algorithmrectilinear link centersimple rectilinear polygon

Mathematics Subject Classification ID

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

Recommendations

• An optimal algorithm for the rectilinear link center of a rectilinear polygon
• An O(n log n) ALGORITHM FOR FINDING A SHORTEST CENTRAL LINK SEGMENT
• An O(n n) algorithm for computing a link center in 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

Cited in

(10)

• A linear time algorithm for the weighted lexicographic rectilinear 1-center problem in the plane
• Location of rectilinear center trajectories
• Optimal parallel algorithms for rectilinear link-distance problems
• Generalized guarding and partitioning for rectilinear polygons
• An optimal algorithm for the rectilinear link center of a rectilinear polygon
• Settling the bound on the rectilinear link radius of a simple rectilinear polygon
• A simple linear algorithm for computing rectilinear 3-centers
• scientific article; zbMATH DE number 176583 (Why is no real title available?)
• Computing the L 1-diameter and center of a simple rectilinear polygon in parallel
• An O(n n) algorithm for computing a link center in a simple polygon

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4037424)