Algorithms for computing centroids

DOI10.1016/0305-0548(93)90071-PzbMath0770.90037MaRDI QIDQ1207205

Thomas L. Morin, Mark J. Kaiser

Publication date: 1 April 1993

Published in: Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

computation of centroidsdiscrete, polygonal, and continuous convex regions in the planezero-dimensional center-of-gravity for discrete systems

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Continuous location (90B85) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Convex sets in (2) dimensions (including convex curves) (52A10) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

Asymmetric distances, semidirected networks and majority in Fermat-Weber problems

Cites Work

• On the deterministic and stochastic approximation of regions
• On the Complexity of Computing the Volume of a Polyhedron
• The Nonlinear Geometry of Linear Programming. II Legendre Transform Coordinates and Central Trajectories
• The Steiner Point of a Convex Polytope
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item