( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Maintaining the Union of Unit Discs under Insertions with Near-Optimal Overhead.

, , , и . ACM Trans. Algorithms, 18 (3): 26:1-26:27 (2022)

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.

Charles Halperin

Louis Halperin

Kirsten Halperin-Krasemann

Dan Stern

Horst Dan

 

Другие публикации лиц с тем же именем

Code Flexibility and Program Efficiency by Genericity: Improving Cgal's Arrangements., , и . ESA, том 3221 из Lecture Notes in Computer Science, стр. 664-676. Springer, (2004)On the Number of Views of Polyhedral Scenes., , , и . JCDCG, том 2098 из Lecture Notes in Computer Science, стр. 81-90. Springer, (2000)Asymptotically near-optimal RRT for fast, high-quality, motion planning., и . ICRA, стр. 4680-4685. IEEE, (2014)Exact and efficient construction of Minkowski sums of convex polyhedra with applications., и . Comput. Aided Des., 39 (11): 929-940 (2007)Fast and robust retrieval of Minkowski sums of rotating convex polyhedra in 3-space., , и . Comput. Aided Des., 43 (10): 1258-1269 (2011)k-color multi-robot motion planning., и . Int. J. Robotics Res., 33 (1): 82-97 (2014)Sparsification of motion-planning roadmaps by edge contraction., , , и . Int. J. Robotics Res., 33 (14): 1711-1725 (2014)Efficient Multi-robot Motion Planning for Unlabeled Discs in Simple Polygons., , , и . WAFR, том 107 из Springer Tracts in Advanced Robotics, стр. 1-17. Springer, (2014)Exact and Efficient Construction of Minkowski Sums of Convex Polyhedra with Applications., и . ALENEX, стр. 3-15. SIAM, (2006)Area Optimal Polygonization Using Simulated Annealing., , и . ACM J. Exp. Algorithmics, (2022)