Author of the publication

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.

 

Other publications of authors with the same name

Visibility of Disjoint Polygons., , , , and . Algorithmica, 1 (1): 49-63 (1986)Do We Need a Stack to Erase a Component in a Binary Image?. FUN, volume 6099 of Lecture Notes in Computer Science, page 16-27. Springer, (2010)Efficient Enumeration of Grid Points in a Polygon and its Application to Integer Programming., , and . Int. J. Comput. Geom. Appl., 4 (1): 69-85 (1994)Translating a convex polyhedron over monotone polyhedra., , and . Comput. Geom., 23 (3): 257-269 (2002)A linear-space algorithm for distance preserving graph embedding., , , , , , and . Comput. Geom., 42 (4): 289-304 (2009)Dynamically maintaining the widest k-dense corridor., , and . Theor. Comput. Sci., 255 (1-2): 627-639 (2001)Effective Use of Geometric Properties for Clustering.. JCDCG, volume 1763 of Lecture Notes in Computer Science, page 30-46. Springer, (1998)Visibility in the Plane., , and . Handbook of Computational Geometry, North Holland / Elsevier, (2000)A New Approximation Algorithm for the Capacitated Vehicle Routing Problem on a Tree., , and . ISAAC, volume 1741 of Lecture Notes in Computer Science, page 317-326. Springer, (1999)Reporting and Counting Intersections of Lines within a Polygon.. ISAAC, volume 834 of Lecture Notes in Computer Science, page 652-659. Springer, (1994)