( en | de | ru )

 

Disambiguation of "Overmars, Mark H."

Author of the publication

copydeleteadd this publication to your clipboard
Union-copy structures and dynamic segment trees

, and . Journal of the ACM, 40 (3): 635―652 (1993)
DOI: http://doi.acm.org/10.1145/174130.174140

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

Flat-State Connectivity of Linkages under Dihedral Motions., , , , , , , , , and 1 other author(s). ISAAC, volume 2518 of Lecture Notes in Computer Science, page 369-380. Springer, (2002)Indicative routes for path planning and crowd simulation., , and . FDG, page 113-120. ACM, (2009)An Input-Size/Output-Size Trade-Off in the Time-Complexity of Rectilinear Hidden Surface Removal (Preliminary Version)., , and . ICALP, volume 443 of Lecture Notes in Computer Science, page 689-702. Springer, (1990)Designing the Computational Geometry Algorithms Library CGAL.. WACG, volume 1148 of Lecture Notes in Computer Science, page 53-58. Springer, (1996)TSP with Neighborhoods of Varying Size., , , , , and . ESA, volume 2461 of Lecture Notes in Computer Science, page 187-199. Springer, (2002)The Art of Dynamizing., and . MFCS, volume 118 of Lecture Notes in Computer Science, page 121-131. Springer, (1981)Connectability Problems.. SWAT, volume 318 of Lecture Notes in Computer Science, page 105-112. Springer, (1988)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)