Showing results 1 to 6 of 6
A Generalization of the Convex Kakeya Problem Ahn, Hee-Kap; Bae, Sang Won; Cheong, Otfried; Gudmundsson, Joachim; Tokuyama, Takeshi; Vigneron, Antoine, ALGORITHMICA, v.70, no.2, pp.152 - 170, 2014-10 |
Computing farthest neighbors on a convex polytope Cheong, Otfried; Shin, Chan-Su; Vigneron, Antoine, Lecture Notes in Computer Science, v.296, pp.159 - 169, 2001 |
Maximizing the overlap of two planar convex sets under rigid motions Ahn, Hee-Kap; Cheong, Otfried; Park, Chong-Dae; Shin, Chan-Su; Vigneron, Antoine, COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, v.37, no.1, pp.3 - 15, 2007-05 |
Reachability by paths of bounded curvature in a convex polygon Ahn, Hee-Kap; Cheong, Otfried; Matousek, Jiri; Vigneron, Antoine, COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, v.45, no.1-2, pp.21 - 32, 2012-01 |
Reverse Nearest Neighbor Queries in Fixed Dimension Cheong, Otfried; Vigneron, Antoine; Yon, Juyoung, INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY APPLICATIONS, v.21, no.2, pp.179 - 188, 2011-04 |
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