Leonidas J. Guibas
- Cam97.S. Cameron. Enhancing GJK: computing minimum and penetration distances between convex polyhedra. In Proc. IEEE Int. Conf. on Robotics and Automation, 1997.Google Scholar
Cross Ref
- CLMP95.J.D. Cohen, M. C. Lin, D. Manocha, and M. K. Ponamgi. I-COLLIDE: An interactive and exact collision detection system for large-scale environments. In 1995 Symposium on interactive 31) Graphics, pages 189-196, 1995. Google ScholarDigital Library
- DK85.D.P. Dobkin and D. G. Kirkpatrick. A linear algorithm for determining the separation of convex polyhedra. J. Algorithms, 6:381-392, 1985.Google ScholarCross Ref
- DK90.D.P. Dobkin and D. G. Kirkpatrick. Determining the separation of preprocessed polyhedra - A unified approach. In Proc. 17th Internat. Colloq. Automata Lang. Program., volume 443 of Lecture Notes Comput. Sci., pages 400-413. Springer-Verlag, 1990. Google ScholarDigital Library
- Ede85.H. Edelsbrunner. Computing the extreme dis. tances between two convex polygons. J. Algorithms, 6:213-224, 1985. Google ScholarDigital Library
- EGSZ99.J. Erickson, L. J. Guibas, J. Stolfi, and L. Zhang. Separation-sensitive convex collision detection. In Proc. l Oth Annual A CM-SIAM Syrup. on Discrete Algorithms, pages 327-336, 1999. Google ScholarDigital Library
- GJK88.E.G. Gilbert, D. W. Johnson, and S. S. Keerthi. A fast procedure for computing the distance between complex objects. IEEE Journal of Robotics and Automation, 4(2), 1988.Google ScholarCross Ref
- GLM96.Stefan Gottschalk, Ming Lin, and Dinesh Manocha. OBB-Tree: A hierarchical structure for rapid interference detection. In Computer Grajphics (SIGGRAPH '96 Proceedings), pages 171-180, 1996. Google ScholarDigital Library
- GMPR77.L. J. Guibas, E. M. McCreight, M. F. Plass, and J. R. Roberts. A new representation for linear lists. In Proc. ACM Syrup. on Theory of Computing, pages 49-60, 1977. Google ScholarDigital Library
- Hub95.P.M. Hubbard. Collision detection for interarive graphics applications. IEE 7"kans. on Visualization and Computer Graphics, 1(3):218-230, 1995. Google ScholarDigital Library
- LC91.M.C. Lin and J. F. Canny. A fast algorithm for incremental distance calculation. In Proc. IEEE Int. Conf. on Robotics and Automation, volume 2, pages 1008-1014, 1991.Google ScholarCross Ref
- Mir97.B. Mirtich. V-Clip: fast and robust polyhedral collision detection. Technical Report TR-97- 05, Mitsubishi Electrical Research Laboratory, 1997.Google Scholar
- Qui94.Sean Quinlan. Efficient distance computation between non-convex objects. In Proc. IEEE Int. Conf. on Robotics and Automation, pages 3324- 3329, 1994.Google ScholarCross Ref
Index Terms
- H-Walk: hierarchical distance computation for moving convex bodies
Recommendations
h-Vectors of Gorenstein polytopes
We show that the Ehrhart h-vector of an integer Gorenstein polytope with a regular unimodular triangulation satisfies McMullen's g-theorem; in particular, it is unimodal. This result generalizes a recent theorem of Athanasiadis (conjectured by Stanley) ...
A Monotonicity Property of h-vectors and h*-vectors
Special issue dedicated to Bernt Lindstro¨mIf is a Cohen-Macaulay simplicial complex of dimension d - 1 and is a Cohen-Macaulay subcomplex of dimension e - 1, such that no e + 1 vertices of form a face of , then we show that h ( ) h( ), where h denotes the h-vector. In particular, h( ) h( ) if ...
Inequalities for the h-Vectors and Flag h-Vectors of Geometric Lattices
We prove that the order complex of a geometric lattice has a convex ear decomposition. As a consequence, if Δ(L) is the order complex of a rank (r + 1) geometric lattice L, then for all i ≤ r/2 the h-vector of Δ(L) satisfies hi-1 ≤ hi and hi ≤ hr-...
Comments