Computing a maxian point of a simple rectilinear polygon

DOI10.1016/J.ORL.2005.12.006MaRDI QIDQ2643818zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 27 August 2007

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.orl.2005.12.006

zbMATH Keywords

analysis of algorithmscomputational geometrydivide and conquerfacility location

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Discrete location and assignment (90B80)

Recommendations

• Computing a median point of a simple rectilinear polygon
• Computing Simple Paths on Points in Simple Polygons
• Computing the longest diagonal of a simple polygon
• scientific article; zbMATH DE number 7650309
• Counting Maximal Points in a Query Orthogonal Rectangle
• Computing the integer points of a polyhedron
• scientific article; zbMATH DE number 4051002

Cites work

• A new bound and an \(O(mn)\) algorithm for the undesirable 1-median problem (maxian) on networks
• AN OPTIMAL DATA STRUCTURE FOR SHORTEST RECTILINEAR PATH QUERIES IN A SIMPLE RECTILINEAR POLYGON
• Computing a median point of a simple rectilinear polygon
• Finding shortest paths in the presence of orthogonal obstacles using a combined L 1 and link metric
• scientific article; zbMATH DE number 4065813 (Why is no real title available?)
• On rectilinear link distance
• Rectilinear decompositions with low stabbing number
• Shortest Path Queries Among Weighted Obstacles in the Rectilinear Plane

Cited in

(2)

• Computing a median point of a simple rectilinear polygon
• Counting Maximal Points in a Query Orthogonal Rectangle

This page was built for publication: Computing a maxian point of a simple rectilinear polygon

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