Author of the publication

Filling Polyhedral Molds.

, , and . WADS, volume 709 of Lecture Notes in Computer Science, page 210-221. Springer, (1993)

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

Maximum Plane Trees in Multipartite Geometric Graphs., , , , , , and . Algorithmica, 81 (4): 1512-1534 (2019)Constrained generalized Delaunay graphs are plane spanners., , and . Comput. Geom., (2018)Continuous Yao graphs., , , , , , , , , and . Comput. Geom., (2018)Feasibility of Design in Stereolithography., , , , , , , and . Algorithmica, 19 (1/2): 61-83 (1997)Efficient Algorithms for Petersen's Matching Theorem., , , and . SODA, page 130-139. ACM/SIAM, (1999)The dilation of the Delaunay triangulation is greater than π/2, , , , and . CoRR, (2010)Art Gallery Localization., , , and . CoRR, (2017)On Generalized Diamond Spanners., , and . WADS, volume 4619 of Lecture Notes in Computer Science, page 325-336. Springer, (2007)Maximum Plane Trees in Multipartite Geometric Graphs., , , , , , and . WADS, volume 10389 of Lecture Notes in Computer Science, page 193-204. Springer, (2017)Efficient Construction of Near-Optimal Binary and Multiway Search Trees., and . WADS, volume 5664 of Lecture Notes in Computer Science, page 230-241. Springer, (2009)