( en | de | ru )

 

Disambiguation of "Halperin, Dan"

Author of the publication

copydeleteadd this publication to your clipboard
k-color multi-robot motion planning.

, and . Int. J. Robotics Res., 33 (1): 82-97 (2014)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Charles Halperin

Louis Halperin

Kirsten Halperin-Krasemann

Dan Stern

Horst Dan

 

Other publications of authors with the same name

Fast and robust retrieval of Minkowski sums of rotating convex polyhedra in 3-space., , and . Symposium on Solid and Physical Modeling, page 1-10. ACM, (2010)The Dynamic Servers Problem., , and . SODA, page 410-419. ACM/SIAM, (1998)Efficient high-quality motion planning by fast all-pairs r-nearest-neighbors., , and . ICRA, page 2985-2990. IEEE, (2015)Efficient sampling-based bottleneck pathfinding over cost maps., and . IROS, page 2003-2009. IEEE, (2017)Sparsification of motion-planning roadmaps by edge contraction., , , and . ICRA, page 4098-4105. IEEE, (2013)On-Line Zone Construction in Arrangements of Lines in the Plane., , , , and . WAE, volume 1668 of Lecture Notes in Computer Science, page 139-153. Springer, (1999)A Perturbation Scheme for Spherical Arrangements with Application to Molecular Modeling., and . SCG, page 183-192. ACM, (1997)On the Complexity of a Single Cell in Certain Arrangements of Surfaces in 3-Space (Extended Abstract).. SCG, page 314-323. ACM, (1991)Efficient Ray Shooting and Hidden Surface Removal., , , , and . SCG, page 21-30. ACM, (1991)On the exact maximum complexity of Minkowski sums of convex polyhedra., , and . SCG, page 319-326. ACM, (2007)