12 search results - page 1 / 3 » Optimal Point Set Partitioning using Rigid Motion Star Place... |
CCCG
2007
14 years 19 days ago
2007
We consider the problem of determining the placement of a star R on a set P of n points in the plane such that a given objective function is maximized. A star R is a set of m rays...
CCCG
2006
14 years 18 days ago
2006
Given a simple polygon P with m vertices and a set S of n points in the plane, we consider the problem of finding a rigid motion placement of P that contains the maximum number of...
ECCV
1998
Springer
15 years 1 months ago
1998
Springer
Registering 3D point sets is a common problem in computer vision. The case of two point sets has been analytically well solved by several authors. In this paper we present an analy...
ICIP
2008
IEEE
14 years 5 months ago
2008
IEEE
Widely used SVD-based matrix factorization approaches to the recovery of 3D rigid structure from motion (SFM), require a set of feature points to be visible in a set of images. Wh...
IPPS
1997
IEEE
14 years 3 months ago
1997
IEEE
Star networks were proposedrecently as an attractive alternative to the well-known hypercube models for interconnection networks. Extensive research has been performed that shows ...