164 search results - page 1 / 33 » Detecting textured objects using convex hull |
60
Voted
MVA
2007
14 years 11 months ago
2007
CCCG
2008
15 years 1 months ago
2008
We prove a tight asymptotic bound of ( log(n/)) on the worst case computational complexity of the convex hull of the union of two convex objects of sizes summing to n requiring o...
BMVC
2000
15 years 1 months ago
2000
A new object recognition method, the Invariant Pixel Set Signature (IPSS), is introduced. Objects are represented with a probability density on the space of invariants computed fr...
102
click to vote
SMA
1995
ACM
15 years 3 months ago
1995
ACM
: Fast and accurate collision detection between general solid models is a fundamental problem in solid modeling, robotics, animation and computer-simulated environments. Most of th...
110
click to vote
COMPGEOM
1996
ACM
15 years 3 months ago
1996
ACM
We show that in the worst case, (ndd=2e;1 +n logn) sidedness queries are required to determine whether the convex hull of n points in IRd is simplicial, or to determine the number ...