@inproceedings{0d85d2cfc7f64dbba779556aaa536229,
title = "Implicitly searching convolutions and computing depth of collision",
abstract = "Given two intersecting polyhedra P, Q and a direction d, find the smallest translation of Q along d that renders the interiors of P and Q disjoint. The same question can also be asked without specifying the direction, in which case the minimum translation over all directions is sought. These are fundamental problems that arise in robotics and computer vision. We develop techniques for implicitly building and searching convolutions and apply them to derive efficient algorithms for these problems.",
author = "David Dobkin and John Hershberger and David Kirkpatrick and Subhash Suri",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1990.; 1st SIGAL International Symposium on Algorithms, 1990 ; Conference date: 16-08-1990 Through 18-08-1990",
year = "1990",
doi = "10.1007/3-540-52921-7_66",
language = "English (US)",
isbn = "9783540529217",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "165--180",
editor = "Toshihide lbaraki and Takao Nishizeki and Hiroshi Imai and Tetsuo Asano",
booktitle = "Algorithms - International Symposium SlGAL 1990, Proceedings",
address = "Germany",
}