Sciweavers

164 search results - page 1 / 33
» Detecting textured objects using convex hull
Sort
View
CCCG
2008
13 years 8 months ago
Convex Hull of the Union of Convex Objects in the Plane: an Adaptive Analysis
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...
Jérémy Barbay, Eric Y. Chen
BMVC
2000
13 years 8 months ago
Object Recognition using the Invariant Pixel-Set Signature
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...
Jiri Matas, J. Burianek, Josef Kittler
SMA
1995
ACM
176views Solid Modeling» more  SMA 1995»
13 years 11 months ago
Incremental algorithms for collision detection between solid models
: 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...
Madhav K. Ponamgi, Dinesh Manocha, Ming C. Lin
COMPGEOM
1996
ACM
13 years 11 months ago
New Lower Bounds for Convex Hull Problems in Odd Dimensions
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 ...
Jeff Erickson