3244 search results - page 52 / 649 » On convex complexity measures |
SIAMCOMP
2008
14 years 11 months ago
2008
Our goal is to find an approximate shortest path for a point robot moving in a planar subdivision with n vertices. Let 1 be a real number. Distances in each face of this subdivis...
SODA
1992
ACM
15 years 15 days ago
1992
ACM
Given a family of disjoint polygons P1, P2, : : :, Pk in the plane, and an integer parameter m, it is NP-complete to decide if the Pi's can be pairwise separated by a polygon...
102
click to vote
VRST
2004
ACM
15 years 4 months ago
2004
ACM
In this paper we present an interactive collision detection algorithm for complex and deformable objects. For two target models, our approach rapidly calculates their region of in...
IROS
2007
IEEE
15 years 5 months ago
2007
IEEE
— This paper describes a compact robot with two magnetic wheels in a bicycle arrangement, which is intended for inspecting the inner casing of pipes with complex shaped structure...
CAD
2000
Springer
14 years 11 months ago
2000
Springer
Very large and geometrically complex scenes, exceeding millions of polygons and hundreds of objects, arise naturally in many areas of interactive computer graphics. Time-critical ...