Sciweavers

195 search results - page 3 / 39
» Fitting a Set of Points by a Circle
Sort
View
CCCG
2003
13 years 7 months ago
Computing the Closest Point to a Circle
In this paper we consider the problem of computing the closest point to the boundary of a circle among a set S of n points. We present two algorithms to solve this problem. One al...
Pinaki Mitra, Asish Mukhopadhyay, S. V. Rao
ICPR
2006
IEEE
14 years 7 months ago
Matching Interest Points Using Affine Invariant Concentric Circles
We present a new method to perform reliable matching between different images. This method finds complete region correspondences between concentric circles and the corresponding p...
Han-Pang Chiu, Tomás Lozano-Pérez
ISAAC
2005
Springer
135views Algorithms» more  ISAAC 2005»
13 years 11 months ago
Embedding Point Sets into Plane Graphs of Small Dilation
Let S be a set of points in the plane. What is the minimum possible dilation of all plane graphs that contain S? Even for a set S as simple as five points evenly placed on the ci...
Annette Ebbers-Baumann, Ansgar Grüne, Marek K...
BMVC
1997
13 years 7 months ago
Further Five Point Fit Ellipse Fitting
The least squares method is the most commonly used technique for fitting an ellipse through a set of points. However, it has a low breakdown point, which means that it performs p...
Paul L. Rosin
ESA
2009
Springer
94views Algorithms» more  ESA 2009»
14 years 25 days ago
Shape Fitting on Point Sets with Probability Distributions
We consider problems on data sets where each data point has uncertainty described by an individual probability distribution. We develop several frameworks and algorithms for calcul...
Maarten Löffler, Jeff M. Phillips