Subdivision methods for sum-of-distances problems: Fermat-Weber point, n-ellipses and the min-sum cluster Voronoi diagram (media exposition)

DOI10.4230/LIPICS.SOCG.2022.69MaRDI QIDQ6539581FDOQ6539581

Authors: Ioannis Mantas, Evanthia Papadopoulou, Martin Suderland, Chee K. Yap 

Publication date: 14 May 2024

Recommendations

• Fast approximations for sums of distances, clustering and the Fermat-Weber problem
• On the Fermat-Weber center of a convex object
• scientific article; zbMATH DE number 510764
• The Fermat-Weber location problem revisited
• n-Ellipses and the Minimum Distance Sum Problem

zbMATH Keywords

geometric medianFermat pointWeber pointsum of distances\(n\)-ellipsemultifocal ellipseFermat distancecluster Voronoi diagrammin-sum Voronoi diagram

Mathematics Subject Classification ID

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

This page was built for publication: Subdivision methods for sum-of-distances problems: Fermat-Weber point, \(n\)-ellipses and the min-sum cluster Voronoi diagram (media exposition)

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