Efficient parallel proximity queries and an application to highly complex motion planning problems with many narrow passages

Erbes, Rainer2013-05-282013-05-282013https://openscience.ub.uni-mainz.de/handle/20.500.12030/2720engInC-1.0https://rightsstatements.org/vocab/InC/1.0/004 Informatik004 Data processingEfficient parallel proximity queries and an application to highly complex motion planning problems with many narrow passagesDissertationurn:nbn:de:hebis:77-34388124 S.