2008-08 | Sparse geometric graphs with small dilation | Aronov, Boris; de Berg, Mark; Cheong, Otfried, et al | ARTICLE | 431 |
|
2008 | Approximate shortest paths in anisotropic regions | Cheng, Siu-Wing; Na, Hyeon-Suk; Vigneron, Antoine, et al | ARTICLE | 496 |
|
2007-11 | A tight lower bound for computing the diameter of a 3D convex polytope | Fournier, Herve; Vigneron, Antoine | ARTICLE | 501 |
|
2007-05 | Maximizing the overlap of two planar convex sets under rigid motions | Ahn, Hee-Kap; Cheong, Otfried; Park, Chong-Dae, et al | ARTICLE | 432 |
|
2007-02 | Motorcycle graphs and straight skeletons | Cheng, Siu-Wing; Vigneron, Antoine | ARTICLE | 464 |
|
2006-02 | Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets | Ahn, HK; Brass, P; Cheong, O, et al | ARTICLE | 481 |
|
2005-09 | The Voronoi diagram of curved objects | Alt, H; Cheong, O; Vigneron, A | ARTICLE | 474 |
|
2004-09 | Packing two disks into a polygonal environment | Bose, Prosenjit; Morin, Pat; Vigneron, Antoine | ARTICLE | 385 |
|
2003-03 | Polynomial time algorithms for three-label point labeling | Duncan, R; Qian, JB; Vigneron, A, et al | ARTICLE | 361 |
|
2003-03 | Computing farthest neighbors on a convex polytope | Cheong, O; Shin, CS; Vigneron, A | ARTICLE | 422 |
|
2003-01 | Reporting intersections among thick objects | Vigneron, A | ARTICLE | 457 |
|
2002-03 | An elementary algorithm for reporting intersections of red/blue curve segments | Boissonnat, JD; Vigneron, A | ARTICLE | 480 |
|
2000-04 | An algorithm for finding a k-median in a directed tree | Vigneron, A; Gao, LX; Golin, MJ, et al | ARTICLE | 315 |
|