Subdivision Methods for Sum-Of-Distances Problems: Fermat-Weber Point, n-Ellipses and the Min-Sum Cluster Voronoi Diagram (Media Exposition)

No abstract is available for this paper.

• Publication year

  2022

• Venue

  International Symposium on Computational Geometry

• Publication date

  Unknown publication date

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.4230/LIPIcs.SoCG.2022.69
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Certified Approximation Algorithms for the Fermat Point and n-Ellipses

  2021cited by this paper
• Farthest Color Voronoi Diagrams: Complexity and Algorithms

  2020cited by this paper
• Randomized incremental construction for the Hausdorff Voronoi diagram revisited and extended

  2016cited by this paper
• Geometric median in nearly linear time

  2016cited by this paper
• Planar Minimization Diagrams via Subdivision with Applications to Anisotropic Voronoi Diagrams

  2016cited by this paper
• The upper envelope of piecewise linear functions: Algorithms and applications

  2015cited by this paper
• Runtime guarantees for regression problems

  2011cited by this paper
• Adaptive Isotopic Approximation of Nonsingular Curves: the Parameterizability and Nonlocal Isotopy Approach

  2011cited by this paper
• Semidefinite Representation of the k-Ellipse

  2007cited by this paper
• Smaller Coresets for k-Median and k-Means Clustering

  2005cited by this paper
• Isotopic approximation of implicit curves and surfaces

  2004cited by this paper
• The hausdorff voronoi diagram of polygonal objects: a divide and conquer approach

  2004cited by this paper
• On the Continuous Fermat-Weber Problem

  2003cited by this paper
• Fast approximations for sums of distances, clustering and the Fermat-Weber problem

  2003cited by this paper
• Approximate clustering via core-sets

  2002cited by this paper
• The Farthest Color Voronoi Diagram and Related Problems

  2001cited by this paper
• Minimizing Polynomial Functions

  2001cited by this paper
• n-Ellipses and the Minimum Distance Sum Problem

  1999cited by this paper
• 2-point site Voronoi diagrams

  1999cited by this paper
• The upper envelope of voronoi surfaces and its applications

  1991cited by this paper
• The algebraic degree of geometric optimization problems

  1988cited by this paper
• An optimal algorithm for constructing the weighted voronoi diagram in the plane

  1984cited by this paper
• Medicina mentis et corporis

  1964cited by this paper
• Tschirnhaus'sche Eiflächen und Eikurven

  1950cited by this paper

• No citing papers are available for this paper.