985 search results - page 102 / 197 » Piercing Convex Sets |
120
click to vote
CCCG
2010
15 years 6 months ago
2010
Given a set B of n blue points in general position, we say that a set of red points R blocks B if in the Delaunay triangulation of B R there is no edge connecting two blue points...
158
click to vote
CVPR
2007
IEEE
16 years 6 months ago
2007
IEEE
Volume intersection is a frequently used technique to solve the Shape-From-Silhouette problem, which constructs a 3D object estimate from a set of silhouettes taken with calibrate...
127
click to vote
CG
2008
Springer
15 years 4 months ago
2008
Springer
This paper presents a fast approach for computing tight surface bounds in meshless animation, and its application to collision detection. Given a high-resolution surface animated ...
154
click to vote
ORDER
2006
15 years 4 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...
142
click to vote
COMGEO
1998
ACM
15 years 4 months ago
1998
ACM
Let P be a set of polygonal pseudodiscs in the plane with n edges in total translating with xed velocities in xed directions. We prove that the maximumnumber of combinatorial chan...