21 search results - page 2 / 5 » Vietoris-Rips Complexes of Planar Point Sets |
ICRA
2005
IEEE
13 years 10 months ago
2005
IEEE
— Moments are generic (and usually intuitive) descriptors that can be computed from several kinds of objects defined either from closed contours or from a set of points. In this...
ACCV
2010
Springer
12 years 12 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...
ICRA
2008
IEEE
13 years 11 months ago
2008
IEEE
— In this paper, we describe the components of a novel algorithm for the extraction of dominant orthogonal planar structures from monocular images taken in indoor environments. T...
SODA
2000
ACM
13 years 6 months ago
2000
ACM
Given a set P of points in the first quadrant, a Rectilinear Steiner Arborescence (RSA) is a directed tree rooted at the origin, containing all points in P, and composed solely of...
COMPGEOM
2009
ACM
13 years 11 months ago
2009
ACM
Given a set system (X, R), the hitting set problem is to find a smallest-cardinality subset H ⊆ X, with the property that each range R ∈ R has a non-empty intersection with H...