450 search results - page 19 / 90 » Quadrangulations of Planar Sets |
SODA
1997
ACM
13 years 10 months ago
1997
ACM
Improving on a recent breakthrough of Sharir, we find two minimum-radius circular disks covering a planar point set, in randomized expected time O(n log2 n).
ACCV
2010
Springer
13 years 4 months ago
2010
Springer
Estimating planar projective transform (homography) from a pair of images is a classical problem in computer vision. In this paper, we propose a novel algorithm for direct register...
ICIP
2005
IEEE
14 years 10 months ago
2005
IEEE
A RANSAC based procedure is described for detecting inliers corresponding to multiple models in a given set of data points. The algorithm we present in this paper (called multiRAN...
DGCI
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. Reversible polyhedral modelling of discrete objects is an important issue to handle those objects. We propose a new algorithm to compute a polygonal face from a discrete ...
JGT
2008
13 years 9 months ago
2008
Let C be a family of n compact connected sets in the plane, whose intersection graph G(C) has no complete bipartite subgraph with k vertices in each of its classes. Then G(C) has ...