104 search results - page 14 / 21 » Intersecting convex sets by rays |
ORDER
2006
13 years 9 months ago
2006
Let r be a fixed positive integer. It is shown that, given any partial orders >1, . . ., >r on the same n-element set P, there exist disjoint subsets A, B P, each with at l...
VLDB
1987
ACM
14 years 1 months ago
1987
ACM
Thie paper presents a representation echeme for polyhedral objects in arbitrary dimensions. Each object ie represented as the algebraic sum of convex polyhedra (cells). Each cell ...
CCCG
1993
13 years 11 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 ...
CGF
2010
13 years 9 months ago
2010
Moving-Least-Squares (MLS) Surfaces undergoing large deformations need periodic regeneration of the point set (point-set resampling) so as to keep the point-set density quasi-unif...
CVPR
2004
IEEE
14 years 11 months ago
2004
IEEE
In this paper a method for fitting open surfaces to an unorganized set of data points is presented using a level set representation of the surface. This is done by tracking a curv...