On condorcet and median points of simple rectilinear polygons

DOI10.1007/3-540-60249-6_50MaRDI QIDQ5055889zbMATH OpenOpenAlexFDO

Authors Victor Chepoi, Feodor F. Dragan

Publication date 9 December 2022

Published in Fundamentals of Computation Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-60249-6_50

zbMATH Keywords

computational geometryCondorcet pointmedian pointrectilinear distancerectilinear polygon

Mathematics Subject Classification ID

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

Recommendations

• Condorcet and median points of simple rectilinear polygons
• Computing a median point of a simple rectilinear polygon
• Algorithms for Voting and Competitive Location on a Network
• Comparison of \(\alpha\)-Condorcet points with median and center locations
• The tolerant Condorcet points

Cites work

• A multifacility location problem on median spaces
• Algorithms for Voting and Competitive Location on a Network
• Computing a median point of a simple rectilinear polygon
• Gated sets in metric spaces
• scientific article; zbMATH DE number 439012 (Why is no real title available?)
• scientific article; zbMATH DE number 4199949 (Why is no real title available?)
• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• scientific article; zbMATH DE number 3697163 (Why is no real title available?)
• Median algebras
• Medians in median graphs
• Networks with Condorcet solutions
• New perspectives in competitive location theory
• On rectilinear link distance
• Optimal Point Location in a Monotone Subdivision
• Optimal Search in Planar Subdivisions
• Outcomes of voting and planning in single facility location problems
• Some Generalizations of Social Decisions under Majority Rule
• State of the Art—Location on Networks: A Survey. Part II: Exploiting Tree Network Structure
• Time bounds for selection
• Triangulating a simple polygon in linear time

Cited in

(6)

• Computing a median point of a simple rectilinear polygon
• Computing Plurality Points and Condorcet Points in Euclidean Space
• Faster algorithms for computing plurality points
• Condorcet and median points of simple rectilinear polygons
• Faster algorithms for computing plurality points
• Comparison of \(\alpha\)-Condorcet points with median and center locations

This page was built for publication: On condorcet and median points of simple rectilinear polygons

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