Convex polytope

A fast procedure for computing the distance between complex objects in three-dimensional space

Éric Gilbert, Daniel Johnson, S. Sathiya Keerthi

Citations: 1470 • 1988

A fast algorithm for incremental distance calculation

Ming C. Lin, John Canny

Citations: 474 • 2002

Enhancing GJK: computing minimum and penetration distances between convex polyhedra

Stephen Cameron

Citations: 286 • 2002

Computing Large Convex Regions of Obstacle-Free Space Through Semidefinite Programming

Robin Deits, Russ Tedrake

Citations: 227 • 2015

A linear algorithm for determining the separation of convex polyhedra

David Dobkin, David Kirkpatrick

Citations: 219 • 1985

Triangulating a non-convex polytype

Bernard Chazelle, Leonidas Palios

Citations: 96 • 1989

Triangulating a nonconvex polytope

Bernard Chazelle, Leonidas Palios

Citations: 91 • 1990

Exact Minkowksi Sums of Polyhedra and Exact and Efficient Decomposition of Polyhedra into Convex Pieces

Peter Hachenberger

Citations: 74 • 2008

A Local Collision Avoidance Method for Non-strictly Convex Polyhedra

Fumio Kanehiro, Florent Lamiraux, Oussama Kanoun, Eiichi Yoshida, Jean‐Paul Laumond

Citations: 66 • 2008

A Tension Distribution Method with Improved Computational Efficiency

Johann Lamaury, Marc Gouttefarde

Citations: 54 • 2012

A fast procedure for computing the distance between complex objects in three space

Éric Gilbert, Daniel Johnson, Sathiya Keerthi

Citations: 52 • 2005

Notes on Convex Sets, Polytopes, Polyhedra, Combinatorial Topology, Voronoi Diagrams and Delaunay Triangulations

Jean Gallier

Citations: 48 • 2008

Computing distances between NURBS-defined convex objects

C. Turnbull, Stephen Cameron

Citations: 39 • 2002

Contributing vertices-based Minkowski sum computation of convex polyhedra

Hichem Barki, Florence Denis, Florent Dupont

Citations: 39 • 2009

Bounds on the Partition Dimension of Convex Polytopes

Jia‐Bao Liu, Muhammad Faisal Nadeem, Muhammad Azeem

Citations: 35 • 2020

Shortest Paths in Euclidean Space with Polyhedral Obstacles.

John H. Reif, James A. Storer

Citations: 33 • 1985

Improvements to algorithms for computing the Minkowski sum of 3-polytopes

Yanyan Wu, Jami J. Shah, Joseph K. Davidson

Citations: 29 • 2003

Sensor-based exploration for convex bodies: a new roadmap for a convex-shaped robot

Jiyeong Lee, Howie Choset

Citations: 24 • 2005

A generic algorithm for constructing hierarchical representations of geometric objects

Patrick Xavier

Citations: 20 • 2002

Measures of intensity of collision between convex objects and their efficient computation

S.S. Keerthi, K. Sridharan

Citations: 18 • 1991