Browse "CS-Conference Papers(학술회의논문)" by Author Vigneron, Antoine

Showing results 1 to 5 of 5

1
A Generalization of the Convex Kakeya Problem

Ahn, Hee-Kap; Bae, Sang Won; Cheong, Otfried; Gudmundsson, Joachim; Tokuyama, Takeshi; Vigneron, Antoine, 10th Latin American Symposium on Theoretical Informatics (LATIN), pp.1 - 12, LATIN'12, 2012-04-16

2
Approximation algorithms for inscribing or circumscribing an axially symmetric polygon to a convex polygon

Cheong, Otfried; Ahn, Hee-Kap; Brass, Peter; Na, Hyeon-Suk; Shin, Chan-Su; Vigneron, Antoine, 10th Annual Intern. Computing and Combinatorics Conference (COCOON) 2004, pp.259 - 268, 2004-08-18

3
Computing Farthest Neighbors on a Convex Polytope

Cheong, Otfried; Shin, Chan-Su; Vigneron, Antoine, The 7th Annual International Computing and Combinatorics Conference 2001, pp.159 - 169, 2001-08-21

4
Maximizing the overlap of two planar convex sets under rigid motions

Ahn, Hee-Kap; Cheong, Otfried; Park, Chong-Dae; Shin, Chan-Su; Vigneron, Antoine, 21st Annual Symposium on Computational Geometry, SCG'05, pp.356 - 363, 2005-06-06

5
Reachability by paths of bounded curvature in convex polygons

Ahn, Hee-Kap; Cheong, Otfried; Matousek, Jiri; Vigneron, Antoine, ACM Symposium on Computational Geometry (SoCG) 2000, pp.251 - 259, 2000-06-14

Discover

rss_1.0 rss_2.0 atom_1.0