Berlin / Minneapolis / Jacobsen / New York / Sacramento / /
Company
IBM / John Wiley & Sons / /
Event
Company Expansion / /
Facility
Stanford University / University of Hong Kong / University of Utah / University of California / /
IndustryTerm
convex algorithm / theoretical algorithms / depth-first search / naive algorithm / minimum distance solution / linear algorithm / large pre-processing step / Refinement algorithms / local search methods / approximate solutions / search time / breadthfirst search / using a simple linear algorithm / /
Organization
National Science Foundation / Center for Computer Graphics and Scientific Visualization / Stanford University / University of Utah / Salt Lake City / University of California / Berkeley / University of Hong Kong / Elaine Cohen Department of Computer Science / /
Person
Elaine Cohen / Francis / David E. Johnson / Susan Anderson / Phil Thesis / Wang / /
Position
haptic controller / General / Cao / /
Product
OBBs / Gilbert / LUB / /
ProvinceOrState
Utah / Minnesota / South Carolina / California / New York / A. B. / /
PublishedMedium
The International Journal / Computer Graphics / Lecture Notes in Computer Science / IEEE Transactions on Computers / /
A Framework For Efficient Minimum Distance Computations By David E. Johnson and Elaine Cohen Department of Computer Science, University of Utah, Salt Lake City, UT 84112