Login / Signup
Penetration Depth Between Two Convex Polyhedra: An Efficient Stochastic Global Optimization Approach.
Mark A. Abramson
Griffin D. Kent
Gavin W. Smith
Published in:
IEEE Trans. Vis. Comput. Graph. (2022)
Keyphrases
</>
global optimization
convex polyhedra
ant colony algorithm
particle swarm optimization
global search
convex hull
pso algorithm
inverse problems
constrained global optimization
similarity measure
minkowski sum
image completion
global solution
search capabilities
depth map
nearest neighbor
color images