Geometric fit of a point set by generalized circles

In our paper we approximate a set of given points by a general circle. More precisely, given two norms k1 and k2 and a set of points in the plane, we consider the problem of locating and scaling the unit circle of norm k1 such that the sum of weighted distances between the circumference of the circle and the given points is minimized, where the distance is measured by a norm k2. We present results for the general case. In the case that k1 and k2 are both polyhedral norms, we are able to solve the problem by investigating a finite candidate set.

• Publication year

  2011

• Venue

  Journal of Global Optimization

• Publication date

  2011-09-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/s10898-010-9623-8
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Locating a general minisum ‘circle’ on the plane

  2011cited by this paper
• Median spheres: theory, algorithms, applications

  2010cited by this paper
• The big cube small cube solution method for multidimensional facility location problems

  2010cited by this paper
• The theoretical and empirical rate of convergence for geometric branch-and-bound methods

  2010cited by this paper
• Erratum to "Locating a minisum circle in the plane" [Discrete Appl. Math. 157 (5) (2009) 901-912]

  2010cited by this paper
• General minisum circle location

  2009cited by this paper
• Locating a minisum circle in the plane

  2009cited by this paper
• Fitting circles to data with correlated noise

  2008cited by this paper
• Estimation of travel distances with the weighted ℓp norm: Some empirical results

  2007cited by this paper
• Locating a Circle on a Sphere

  2007cited by this paper
• Locating a Circle on the Plane Using the Minimax Criterion

  2006cited by this paper
• Locating median cycles in networks

  2005cited by this paper
• The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems

  2004cited by this paper
• A finite algorithm to fit geometrically all midrange lines, circles, planes, spheres, hyperplanes, and hyperspheres

  2002cited by this paper
• On the circle closest to a set of points

  2002cited by this paper
• Effective circle fitting for particle trajectories

  2002cited by this paper
• Gauge Distances and Median Hyperplanes

  2001cited by this paper
• Facility location : applications and theory

  2001cited by this paper
• Locating lines and hyperplanes

  1999cited by this paper
• Facility location: a survey of applications and methods

  1996cited by this paper
• GBSSS: The generalized big square small square method for planar single-facility location

  1992cited by this paper
• FACILITIES LOCATION: MODELS AND METHODS

  1988cited by this paper
• Using Block Norms for Location Modeling

  1985cited by this paper
• Technical Note - A New Norm for Measuring Distance Which Yields Linear Location Problems

  1980cited by this paper
• Location of the Median Line for Weighted Points

  1975cited by this paper
• Locating Concentric Ring Roads in a City

  1974cited by this paper
• On Circular Functional Relationships

  1965cited by this paper

• Applications

  2021cites this paper
• Locating Dimensional Facilities in a Continuous Space

  2019cites this paper
• A location–allocation problem with concentric circles

  2015cites this paper
• Location of Dimensional Facilities in a Continuous Space

  2015cites this paper
• Locating an axis-parallel rectangle on a Manhattan plane

  2014cites this paper
• Locating an axis-parallel rectangle on a Manhattan plane

  2012cites this paper
• Minsum hyperspheres in normed spaces

  2012cites this paper
• Locating a general minisum ‘circle’ on the plane

  2011cites this paper