1245 search results - page 42 / 249 » Triangulation for Points on Lines |
CCCG
2003
14 years 11 months ago
2003
Suppose one has a line arrangement and one wants to find a shortest path from one point lying on a line of the arrangement to another such point. We look at a special case: the a...
CGI
2001
IEEE
15 years 1 months ago
2001
IEEE
30 digitization devices produce very large sets of 3 0 points sampled from the suqaces of the objects being scanned. A mesh construction procedure needs to be:upplied to derive po...
SMI
2010
IEEE
14 years 8 months ago
2010
IEEE
—We present an algorithm for curve skeleton extraction via Laplacian-based contraction. Our algorithm can be applied to surfaces with boundaries, polygon soups, and point clouds....
CVPR
2000
IEEE
15 years 11 months ago
2000
IEEE
An algorithm is given for computing projective structure from a set of six points seen in a sequence of many images. The method is based on the notion of duality between cameras a...
ALGORITHMICA
2010
14 years 9 months ago
2010
In this paper, we give a lower bound of (n(d-1)/2 ) on the quantum query complexity for finding a fixed point of a discrete Brouwer function over grid [1 : n]d . Our bound is near...