Computing a median point of a simple rectilinear polygon

DOI10.1016/0020-0190(94)90100-7zbMath0803.68133OpenAlexW2117639115MaRDI QIDQ1321814

Feodor F. Dragan, Victor Chepoi

Publication date: 3 May 1994

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

Full work available at URL: https://doi.org/10.1016/0020-0190(94)90100-7

zbMATH Keywords

rectilinear polygoncomputational geometrymedian problemrectilinear distance

Mathematics Subject Classification ID

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

Related Items (6)

On finding medians of weighted discrete points ⋮ On condorcet and median points of simple rectilinear polygons ⋮ Computing a maxian point of a simple rectilinear polygon ⋮ A multifacility location problem on median spaces ⋮ Median problem in some plane triangulations and quadrangulations. ⋮ PARETO ENVELOPES IN SIMPLE POLYGONS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Medians in median graphs
• On rectilinear link distance
• Gated sets in metric spaces
• The median procedure in cluster analysis and social choice theory
• Triangulating a simple polygon in linear time
• Median algebras
• A Formal Theory of Consensus
• State of the Art—Location on Networks: A Survey. Part II: Exploiting Tree Network Structure
• Optimal Point Location in a Monotone Subdivision
• Optimal Search in Planar Subdivisions

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