Showing results 5 to 10 of 10
Farthest-polygon Voronoi diagrams Cheong, Otfried; Everett, Hazel; Glisse, Marc; Gudmundsson, Joachim; Hornus, Samuel; Lazard, Sylvain; Lee, Mira; et al, COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, v.44, no.4, pp.234 - 247, 2011-05 |
Farthest-polygon voronoi diagrams Cheong, Otfried; Everett, Hazel; Glisse, Marc; Gudmundsson, Joachim; Hornus, Samuel; Lazard, Sylvain; Lee, Mira; et al, 15th Annual European Symposium on Algorithms, ESA 2007, pp.407 - 418, ESA 2007, 2007-10-08 |
Measuring the similarity of geometric graphs Cheong, Otfried; Gudmundsson, Joachim; Kim, Hyo-Sil; Schymura, Daria; Stehn, Fabian, 8th International Symposium on Experimental Algorithms, SEA 2009, pp.101 - 112, 2009-06-04 |
Shortcuts for the circle Bae, Sang Won; de Berg, Mark; Cheong, Otfried; Gudmundsson, Joachim; Levcopoulos, Christos, COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, v.79, pp.37 - 54, 2019-02 |
Shortcuts for the Circle Cheong, Otfried; Bae, Sang Won; Berg, Mark de; Gudmundsson, Joachim; Levcopoulos, Christos, The 28th International Symposium on Algorithms and Computation, ISAAC Committee, 2017-12-11 |
Sparse geometric graphs with small dilation Aronov, Boris; de Berg, Mark; Cheong, Otfried; Gudmundsson, Joachim; Haverkort, Herman; Smid, Michiel; Vigneron, Antoine, COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, v.40, no.3, pp.207 - 219, 2008-08 |
Discover