Sciweavers

195 search results - page 6 / 39
» Fitting a Set of Points by a Circle
Sort
View
MVA
1990
123views Computer Vision» more  MVA 1990»
13 years 9 months ago
Randomized Hough Transform (RHT) in Engineering Drawing Vectorization System
Abstract When the data is processed from the digitized drawThis paper presents how the recently presented Randomized IIough Transform (RHT) method can be used as a part of an engin...
Pekka Kultanen, Erkki Oja, Lei Xu
COMPGEOM
2007
ACM
14 years 14 days ago
Computing the exact arrangement of circles on a sphere, with applications in structural biology: video
The Bentley-Ottmann (BO) algorithm, initially designed to report the intersection points of line-segments in the plane, is the prototypical sweep-line algorithm. This video presen...
Frédéric Cazals, Sébastien Lo...
ISAAC
2004
Springer
125views Algorithms» more  ISAAC 2004»
14 years 1 months ago
Polyline Fitting of Planar Points Under Min-sum Criteria
Fitting a curve of a certain type to a given set of points in the plane is a basic problem in statistics and has numerous applications. We consider fitting a polyline with k join...
Boris Aronov, Tetsuo Asano, Naoki Katoh, Kurt Mehl...
CCCG
2008
13 years 10 months ago
Smallest enclosing circle centered on a query line segment
Given a set of n points P = {p1, p2, . . . , pn} in the plane, we show how to preprocess P such that for any query line segment L we can report in O(log n) time the smallest enclo...
Prosenjit Bose, Stefan Langerman, Sasanka Roy
ICPR
2008
IEEE
14 years 3 months ago
Iris localization based on multi-resolution analysis
Iris localization is an especially important step in the whole iris recognition system, for it determines the accuracy of matching partially. To improve its accuracy and efficienc...
Lili Pan, Mei Xie, Zheng Ma