An improved implementation and analysis of the Diaz and O'Rourke algorithm for finding the Simpson point of a convex polygon

DOI10.1080/00207160801965180zbMath1183.68024OpenAlexW1981540898MaRDI QIDQ5852137

No author found.

Publication date: 26 January 2010

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160801965180

zbMATH Keywords

iterative algorithmscompetitive locationgeometric optimisationSimpson pointcentre of area

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Operations research and management science (90Bxx) Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Competitive location in the plane
• Partitions of mass-distributions and of convex bodies by hyperplanes
• Sequential location problems
• Algorithms for Voting and Competitive Location on a Network
• Continuous Location Theory Under Majority Rule
• Simpson Points in Planar Problems with Locational Constraints. The Round-Norm Case
• Simpson Points in Planar Problems with Locational Constraints. The Polyhedral-Gauge Case
• COMPUTING THE CENTER OF AREA OF A CONVEX POLYGON
• Forbidden Regions are Convex
• Forbidden Area
• Static competitive facility location: an overview of optimisation approaches.

This page was built for publication: An improved implementation and analysis of the Diaz and O'Rourke algorithm for finding the Simpson point of a convex polygon