Improving the GJK Algorithm for Faster and More Reliable Distance Queries Between Convex Objects.

Mattia Montanari Nik Petrinic Ettore Barbieri

Published in: ACM Trans. Graph. (2017)

Keyphrases

computational complexity
times faster
matching algorithm
preprocessing
search space
dynamic programming
distance function

simulated annealing
globally optimal
distance metric
convergence rate
skyline queries
detection algorithm
memory efficient

cost function
k means
distance matrix
data objects
hamming distance
similarity measure
convex hull

euclidean distance
attribute values
particle swarm optimization
linear programming
worst case
objective function