450 search results - page 19 / 90 » Quadrangulations of Planar Sets |
150
click to vote
SODA
1997
ACM
15 years 7 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).
140
click to vote
ACCV
2010
Springer
15 years 1 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...
163
click to vote
ICIP
2005
IEEE
16 years 7 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...
137
click to vote
DGCI
2005
Springer
15 years 11 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 ...
145
click to vote
JGT
2008
15 years 6 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 ...