MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "An Algorithm for Convex Polytopes." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

18 documents found, showing 1 through 10. Next 10 →

ATOM

An efficient algorithm for shortest paths on a convex polytope in three dimensions, preliminary
by Yevgeny Schreiber, Micha Sharir — 2006 — in Proc. 22nd ACM Sympos. Comput. Geom
…An Optimal-Time Algorithm for Shortest Paths on a Convex Polytope in Three Dimensions ∗ Yevgeny…
Cited by 3 (0 self) – Add To MetaCart

DEEP: Dual-space Expansion for Estimating Penetration depth between convex polytopes
by Young J. Kim, Ming C. Lin, Dinesh Manocha — 2002 — In IEEE Conference on Robotics and Automation
… between convex polytopes in 3D. The algorithm incrementally seeks a “locally optimal solution” by walking…
Cited by 14 (5 self) – Add To MetaCart

Incremental Penetration Depth Estimation Between Convex Polytopes Using Dual-space Expansion
by Young J. Kim, Ming C. Lin, Dinesh Manocha — 2004
… the penetration depth between convex polytopes in 3D. The algorithm incrementally seeks a “locally optimal…
Cited by 7 (1 self) – Add To MetaCart

Bridging Convex Regions and Related Problems
by Hee-kap Ahn, Otfried Cheong, Chan-Su Shin
… p 2 times of the optimal one. If the regions are convex polytopes, then the algorithm computes…
Add To MetaCart

Six-Degree-of-Freedom Haptic Display Using Localized Contact Computations
by Young J. Kim, Miguel A. Otaduy, Ming C. Lin, Dinesh Manocha — 2002
… against nodes in another BVH. We use an efficient, incremental algorithm for convex polytopes [26] based…
Cited by 23 (3 self) – Add To MetaCart

Collision and Proximity Queries
by Ming C. Lin, Dinesh Manocha — 2003
…-distance computation between a pair of convex polytopes. A number of algorithms with good asymptotic performance have…
Cited by 43 (13 self) – Add To MetaCart

Incremental algorithms for collision detection between solid models
by Madhav K. Ponamgi, Dinesh Manocha, Ming C. Lin — 1995 — IEEE Transactions on Visualization and Computer Graphics
… or the motions of the objects. 3 Background We review our previous algorithm for multiple moving convex polytopes…
Cited by 70 (7 self) – Add To MetaCart

Collision Detection: Algorithms and Applications
by Ming C. Lin, USA Dinesh Manocha, Jon Cohen — 1996
… algorithm for multiple moving convex polytopes in complex environments. Coherence combined with incremental…
Cited by 40 (1 self) – Add To MetaCart

I-COLLIDE: An interactive and exact collision detection system for large-scale environments
by Jonathan D. Cohen, Ming C. Lin, Dinesh Manocha, Madhav Ponamgi — 1995 — In Proc. of ACM Interactive 3D Graphics Conference
… detection algo- rithm which tracks closest points between pairs of convex polytopes [IS, 171. This algorithm…
Cited by 222 (24 self) – Add To MetaCart

I-COLLIDE: An Interactive and Exact Collision Detection System for Large-Scale Environments
by Jonathan Cohen Ming, Ming C. Lin, Dinesh Manocha, Madhav K. Ponamgi — 1995 — In Proc. of ACM Interactive 3D Graphics Conference
… algorithm which tracks closest points between pairs of convex polytopes [16, 17]. This algorithm is used…
Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB