235 search results - page 32 / 47 » On joint triangulations of two sets of points in the plane |
CCCG
1993
13 years 8 months ago
1993
A k-dense corridor through a finite set, S, of n points in the plane is the open region of the plane that is bounded by two parallel lines that intersect the convex hull of S and ...
CVPR
2006
IEEE
14 years 8 months ago
2006
IEEE
We propose a novel method for tracking an articulated model in a 3D-point cloud. The tracking problem is formulated as the registration of two point sets, one of them parameterise...
ISAAC
2004
Springer
14 years 3 days ago
2004
Springer
In the Paired Pointset Traversal problem we ask whether, given two sets A = {a1, . . . , an} and B = {b1, . . . , bn} in the plane, there is an ordering π of the points such that ...
CCCG
2006
13 years 8 months 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...
COMGEO
2011
ACM
13 years 1 months ago
2011
ACM
Let P be a set of n points in the plane. A geometric proximity graph on P is a graph where two points are connected by a straight-line segment if they satisfy some prescribed prox...