Author of the publication

A pointed Delaunay pseudo-triangulation of a simple polygon.

, and . EuroCG, page 77-80. Technische Universiteit Eindhoven, (2005)

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

Memory-Constrained Algorithms for Simple Polygons, , , , , , and . CoRR, (2011)Small grid embeddings of 3-polytopes, , and . CoRR, (2009)Memory-constrained algorithms for simple polygons., , , , , , and . Comput. Geom., 46 (8): 959-969 (2013)On numbers of pseudo-triangulations., , and . Comput. Geom., 46 (6): 688-699 (2013)Bounds on the maximum multiplicity of some common geometric graphs., , , and . STACS, volume 9 of LIPIcs, page 637-648. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2011)Algorithms for Designing Pop-Up Cards., , , , , , , , and . STACS, volume 20 of LIPIcs, page 269-280. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2013)Does Anybody Need Help? Pupils and Teachers in Harmony - Creating an Adaptive Visualisation-module for Teachers to Support their Scheduling and Teaching Processes., , and . CSEDU (2), page 446-450. INSTICC Press, (2010)The Union of Colorful Simplices Spanned by a Colored Point Set., and . COCOA (1), volume 6508 of Lecture Notes in Computer Science, page 324-338. Springer, (2010)Augmenting Geometric Graphs with Matchings., , , and . GD, volume 12590 of Lecture Notes in Computer Science, page 490-504. Springer, (2020)Pointed drawings of planar graphs., , , and . Comput. Geom., 45 (9): 482-494 (2012)