( en | de | ru )

 

Disambiguation of "Overmars, Mark H."

Author of the publication

copydeleteadd this publication to your clipboard
Concatenable Segment Trees (Extended Abstract).

, and . STACS, volume 349 of Lecture Notes in Computer Science, page 493-504. Springer, (1989)

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.

H -H Kaatz

Mark Yampolsky

Maßnahmen zur Sicherung von E2E-QoS bei verketteten Diensten. Uni München, (2009)

Florian H H Giesert

Mark Schütte

Crf2 - ein neues Antigen von Aspergillus fumigatus. TU Braunschweig, (2009)

Lobna H airall h

 

Other publications of authors with the same name

Reachability Analysis of Sampling Based Planners., and . ICRA, page 404-410. IEEE, (2005)Dynamization of Order Decomposable Set Problems.. J. Algorithms, 2 (3): 245-260 (1981)Corrigendum: J. Algorithms 4(3): 301 (1983).Computing maximally separated sets in the plane and independent sets in the intersection graph of unit disks., , and . SODA, page 516-525. SIAM, (2004)Indicative routes for path planning and crowd simulation., , and . FDG, page 113-120. ACM, (2009)Multilevel Path Planning for Nonholonomic Robots Using Semiholonomic Subsystems., , , and . Int. J. Robotics Res., 17 (8): 840-857 (1998)Using Workspace Information as a Guide to Non-uniform Sampling in Probabilistic Roadmap Planners., and . Int. J. Robotics Res., 24 (12): 1055-1071 (2005)Creating High-quality Paths for Motion Planning., and . Int. J. Robotics Res., 26 (8): 845-863 (2007)Real Time Animation of Virtual Humans: A Trade-off Between Naturalness and Control., , , , and . Eurographics (State of the Art Reports), page 45-72. Eurographics Association, (2009)Separating Point Sets in Polygonal Environments., , , , , , , and . Int. J. Comput. Geom. Appl., 15 (4): 403-420 (2005)Computing Signed Permutations of Polygons., , , , , , and . Int. J. Comput. Geom. Appl., 21 (1): 87-100 (2011)