Locating a general minisum `circle' on the plane
From MaRDI portal
Publication:766255
Recommendations
Cites work
- A finite algorithm to fit geometrically all midrange lines, circles, planes, spheres, hyperplanes, and hyperspheres
- Continuous location of dimensional structures.
- Fitting circles to data with correlated noise
- Geometric fit of a point set by generalized circles
- Geometrical properties of the Fermat-Weber problem
- Locating a Circle on a Sphere
- Locating a circle on the plane using the minimax criterion
- Locating a minisum circle in the plane
- Locating lines and hyperplanes. Theory and algorithms
- Locating median cycles in networks
- Location theory. A unified approach
- Median spheres: Theory, algorithms, applications
- On bisectors for different distance functions
- On the circle closest to a set of points
- Some Characterizations of Inner-Product Spaces
- Technical Note—A New Norm for Measuring Distance Which Yields Linear Location Problems
- The Fermat--Torricelli problem in normed planes and spaces
- Using Block Norms for Location Modeling
Cited in
(9)- Locating a circle on the plane using the minimax criterion
- On an approximate minimax circle closest to a set of points.
- The geometry of optimal partitions in location problems
- Mathematical models for the variable weights version of the inverse minimax circle location problem
- On the circle closest to a set of points
- Locating an axis-parallel rectangle on a Manhattan plane
- Locating a minisum circle in the plane
- Locating a minisum annulus: a new partial coverage distance model
- Minsum hyperspheres in normed spaces
This page was built for publication: Locating a general minisum `circle' on the plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q766255)