Fitting concentric circles to measurements
From MaRDI portal
Publication:2441575
DOI10.1007/s00186-013-0455-4zbMath1288.90064MaRDI QIDQ2441575
Publication date: 25 March 2014
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00186-013-0455-4
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90C26: Nonconvex programming, global optimization
Related Items
Locating a minisum annulus: a new partial coverage distance model, Data clustering for circle detection
Cites Work
- Unnamed Item
- The big cube small cube solution method for multidimensional facility location problems
- A general global optimization approach for solving location problems in the plane
- Fitting circles to data with correlated noise
- Locating a minisum circle in the plane
- Constructing a DC decomposition for ordered median problems
- GBSSS: The generalized big square small square method for planar single- facility location
- Approximation algorithms for minimum-width annuli and shells
- A finite algorithm to fit geometrically all midrange lines, circles, planes, spheres, hyperplanes, and hyperspheres
- Locating median cycles in networks
- A d.c. optimization method for single facility location problems
- Median spheres: Theory, algorithms, applications
- Solving the ordered one-median problem in the plane
- Location Theory
- IMPROVEMENTS OF THE INCREMENTAL METHOD FOR THE VORONOI DIAGRAM WITH COMPUTATIONAL COMPARISON OF VARIOUS ALGORITHMS
- The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems
- Two algorithms for constructing a Delaunay triangulation
- A ROBUST TOPOLOGY-ORIENTED INCREMENTAL ALGORITHM FOR VORONOI DIAGRAMS
- On the circle closest to a set of points