2009 |
29 | EE | Peter Brass,
Christian Knauer,
Hyeon-Suk Na,
Chan-Su Shin,
Antoine Vigneron:
Computing k-Centers On a Line
CoRR abs/0902.3282: (2009) |
2008 |
28 | EE | Sunil Arya,
David M. Mount,
Antoine Vigneron,
Jian Xia:
Space-Time Tradeoffs for Proximity Searching in Doubling Spaces.
ESA 2008: 112-123 |
27 | EE | Hervé Fournier,
Antoine Vigneron:
Fitting a Step Function to a Point Set.
ESA 2008: 442-453 |
26 | EE | Boris Aronov,
Mark de Berg,
Otfried Cheong,
Joachim Gudmundsson,
Herman J. Haverkort,
Michiel H. M. Smid,
Antoine Vigneron:
Sparse geometric graphs with small dilation.
Comput. Geom. 40(3): 207-219 (2008) |
25 | EE | Siu-Wing Cheng,
Hyeon-Suk Na,
Antoine Vigneron,
Yajun Wang:
Approximate Shortest Paths in Anisotropic Regions.
SIAM J. Comput. 38(3): 802-824 (2008) |
2007 |
24 | EE | Siu-Wing Cheng,
Hyeon-Suk Na,
Antoine Vigneron,
Yajun Wang:
Approximate shortest paths in anisotropic regions.
SODA 2007: 766-774 |
23 | EE | Siu-Wing Cheng,
Hyeon-Suk Na,
Antoine Vigneron,
Yajun Wang:
Querying approximate shortest paths in anisotropic regions.
Symposium on Computational Geometry 2007: 84-91 |
22 | EE | Siu-Wing Cheng,
Antoine Vigneron:
Motorcycle Graphs and Straight Skeletons.
Algorithmica 47(2): 159-182 (2007) |
21 | EE | Hervé Fournier,
Antoine Vigneron:
A Tight Lower Bound for Computing the Diameter of a 3D Convex Polytope.
Algorithmica 49(3): 245-257 (2007) |
20 | EE | Boris Aronov,
Mark de Berg,
Otfried Cheong,
Joachim Gudmundsson,
Herman J. Haverkort,
Michiel H. M. Smid,
Antoine Vigneron:
Sparse geometric graphs with small dilation
CoRR abs/cs/0702080: (2007) |
19 | EE | Hee-Kap Ahn,
Otfried Cheong,
Chong-Dae Park,
Chan-Su Shin,
Antoine Vigneron:
Maximizing the overlap of two planar convex sets under rigid motions.
Comput. Geom. 37(1): 3-15 (2007) |
2006 |
18 | EE | Hervé Fournier,
Antoine Vigneron:
Lower Bounds for Geometric Diameter Problems.
LATIN 2006: 467-478 |
17 | EE | Hee-Kap Ahn,
Peter Braß,
Otfried Cheong,
Hyeon-Suk Na,
Chan-Su Shin,
Antoine Vigneron:
Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets.
Comput. Geom. 33(3): 152-164 (2006) |
2005 |
16 | EE | Kumar Gaurav Bijay,
Antoine Vigneron:
A practical approach to approximating diameter of point-set in low dimensions.
CCCG 2005: 3-6 |
15 | EE | Boris Aronov,
Mark de Berg,
Otfried Cheong,
Joachim Gudmundsson,
Herman J. Haverkort,
Antoine Vigneron:
Sparse Geometric Graphs with Small Dilation.
ISAAC 2005: 50-59 |
14 | EE | Hee-Kap Ahn,
Otfried Cheong,
Chong-Dae Park,
Chan-Su Shin,
Antoine Vigneron:
Maximizing the overlap of two planar convex sets under rigid motions.
Symposium on Computational Geometry 2005: 356-363 |
13 | EE | Helmut Alt,
Otfried Cheong,
Antoine Vigneron:
The Voronoi Diagram of Curved Objects.
Discrete & Computational Geometry 34(3): 439-453 (2005) |
2004 |
12 | EE | Hee-Kap Ahn,
Peter Braß,
Otfried Cheong,
Hyeon-Suk Na,
Chan-Su Shin,
Antoine Vigneron:
Approximation Algorithms for Inscribing or Circumscribing an Axially Symmetric Polygon to a Convex Polygon.
COCOON 2004: 259-267 |
11 | EE | Prosenjit Bose,
Pat Morin,
Antoine Vigneron:
Packing two disks into a polygonal environment.
J. Discrete Algorithms 2(3): 373-380 (2004) |
2003 |
10 | EE | Antoine Vigneron:
Reporting intersections among thick objects.
Inf. Process. Lett. 85(2): 87-92 (2003) |
9 | EE | Otfried Cheong,
Chan-Su Shin,
Antoine Vigneron:
Computing farthest neighbors on a convex polytope.
Theor. Comput. Sci. 296(1): 47-58 (2003) |
8 | EE | Rob Duncan,
Jianbo Qian,
Antoine Vigneron,
Binhai Zhu:
Polynomial time algorithms for three-label point labeling.
Theor. Comput. Sci. 296(1): 75-87 (2003) |
2002 |
7 | EE | Siu-Wing Cheng,
Antoine Vigneron:
Motorcycle graphs and straight skeletons.
SODA 2002: 156-165 |
6 | | Jean-Daniel Boissonnat,
Antoine Vigneron:
An elementary algorithm for reporting intersections of red/blue curve segments.
Comput. Geom. 21(3): 167-175 (2002) |
2001 |
5 | EE | Prosenjit Bose,
Pat Morin,
Antoine Vigneron:
Packing Two Disks into a Polygonal Environment.
COCOON 2001: 142-149 |
4 | EE | Otfried Cheong,
Chan-Su Shin,
Antoine Vigneron:
Computing Farthest Neighbors on a Convex Polytope.
COCOON 2001: 159-169 |
2000 |
3 | EE | Jean-Daniel Boissonnat,
Antoine Vigneron:
An Elementary Algorithm for Reporting Intersections of Red/Blue Curve Segments.
CCCG 2000 |
2 | EE | Hee-Kap Ahn,
Otfried Cheong,
Jirí Matousek,
Antoine Vigneron:
Reachability by paths of bounded curvature in convex polygons.
Symposium on Computational Geometry 2000: 251-259 |
1 | EE | Antoine Vigneron,
Lixin Gao,
Mordecai J. Golin,
Giuseppe F. Italiano,
Bo Li:
An algorithm for finding a k-median in a directed tree.
Inf. Process. Lett. 74(1-2): 81-88 (2000) |