SCEAS

The SCEAS System

Search the dblp DataBase

Title:
Author:

Antoine Vigneron: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

Kumar Gaurav Bijay, Antoine Vigneron
A practical approach to approximating diameter of point-set in low dimensions. [Citation Graph (0, 0)][DBLP]
CCCG, 2005, pp:3-6 [Conf]
Jean-Daniel Boissonnat, Antoine Vigneron
An Elementary Algorithm for Reporting Intersections of Red/Blue Curve Segments. [Citation Graph (0, 0)][DBLP]
CCCG, 2000, pp:- [Conf]
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. [Citation Graph (0, 0)][DBLP]
COCOON, 2004, pp:259-267 [Conf]
Prosenjit Bose, Pat Morin, Antoine Vigneron
Packing Two Disks into a Polygonal Environment. [Citation Graph (0, 0)][DBLP]
COCOON, 2001, pp:142-149 [Conf]
Otfried Cheong, Chan-Su Shin, Antoine Vigneron
Computing Farthest Neighbors on a Convex Polytope. [Citation Graph (0, 0)][DBLP]
COCOON, 2001, pp:159-169 [Conf]
Hee-Kap Ahn, Otfried Cheong, Jirí Matousek, Antoine Vigneron
Reachability by paths of bounded curvature in convex polygons. [Citation Graph (0, 0)][DBLP]
Symposium on Computational Geometry, 2000, pp:251-259 [Conf]
Hee-Kap Ahn, Otfried Cheong, Chong-Dae Park, Chan-Su Shin, Antoine Vigneron
Maximizing the overlap of two planar convex sets under rigid motions. [Citation Graph (0, 0)][DBLP]
Symposium on Computational Geometry, 2005, pp:356-363 [Conf]
Siu-Wing Cheng, Hyeon-Suk Na, Antoine Vigneron, Yajun Wang
Querying approximate shortest paths in anisotropic regions. [Citation Graph (0, 0)][DBLP]
Symposium on Computational Geometry, 2007, pp:84-91 [Conf]
Boris Aronov, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Herman J. Haverkort, Antoine Vigneron
Sparse Geometric Graphs with Small Dilation. [Citation Graph (0, 0)][DBLP]
ISAAC, 2005, pp:50-59 [Conf]
Hervé Fournier, Antoine Vigneron
Lower Bounds for Geometric Diameter Problems. [Citation Graph (0, 0)][DBLP]
LATIN, 2006, pp:467-478 [Conf]
Siu-Wing Cheng, Antoine Vigneron
Motorcycle graphs and straight skeletons. [Citation Graph (0, 0)][DBLP]
SODA, 2002, pp:156-165 [Conf]
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. [Citation Graph (0, 0)][DBLP]
Comput. Geom., 2006, v:33, n:3, pp:152-164 [Journal]
Jean-Daniel Boissonnat, Antoine Vigneron
An elementary algorithm for reporting intersections of red/blue curve segments. [Citation Graph (0, 0)][DBLP]
Comput. Geom., 2002, v:21, n:3, pp:167-175 [Journal]
Helmut Alt, Otfried Cheong, Antoine Vigneron
The Voronoi Diagram of Curved Objects. [Citation Graph (0, 0)][DBLP]
Discrete & Computational Geometry, 2005, v:34, n:3, pp:439-453 [Journal]
Antoine Vigneron
Reporting intersections among thick objects. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 2003, v:85, n:2, pp:87-92 [Journal]
Antoine Vigneron, Lixin Gao, Mordecai J. Golin, Giuseppe F. Italiano, Bo Li
An algorithm for finding a k-median in a directed tree. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 2000, v:74, n:1-2, pp:81-88 [Journal]
Prosenjit Bose, Pat Morin, Antoine Vigneron
Packing two disks into a polygonal environment. [Citation Graph (0, 0)][DBLP]
J. Discrete Algorithms, 2004, v:2, n:3, pp:373-380 [Journal]
Otfried Cheong, Chan-Su Shin, Antoine Vigneron
Computing farthest neighbors on a convex polytope. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2003, v:296, n:1, pp:47-58 [Journal]
Rob Duncan, Jianbo Qian, Antoine Vigneron, Binhai Zhu
Polynomial time algorithms for three-label point labeling. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2003, v:296, n:1, pp:75-87 [Journal]
Siu-Wing Cheng, Hyeon-Suk Na, Antoine Vigneron, Yajun Wang
Approximate shortest paths in anisotropic regions. [Citation Graph (0, 0)][DBLP]
SODA, 2007, pp:766-774 [Conf]
Siu-Wing Cheng, Antoine Vigneron
Motorcycle Graphs and Straight Skeletons. [Citation Graph (0, 0)][DBLP]
Algorithmica, 2007, v:47, n:2, pp:159-182 [Journal]
Hee-Kap Ahn, Otfried Cheong, Chong-Dae Park, Chan-Su Shin, Antoine Vigneron
Maximizing the overlap of two planar convex sets under rigid motions. [Citation Graph (0, 0)][DBLP]
Comput. Geom., 2007, v:37, n:1, pp:3-15 [Journal]
Boris Aronov, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Herman J. Haverkort, Michiel H. M. Smid, Antoine Vigneron
Sparse geometric graphs with small dilation [Citation Graph (0, 0)][DBLP]
CoRR, 2007, v:0, n:, pp:- [Journal]
Space-Time Tradeoffs for Proximity Searching in Doubling Spaces. [Citation Graph (, )][DBLP]
Fitting a Step Function to a Point Set. [Citation Graph (, )][DBLP]
Geometric Optimization and Sums of Algebraic Functions. [Citation Graph (, )][DBLP]
A Tight Lower Bound for Computing the Diameter of a 3D Convex Polytope. [Citation Graph (, )][DBLP]
Sparse geometric graphs with small dilation. [Citation Graph (, )][DBLP]
Computing k-Centers On a Line [Citation Graph (, )][DBLP]
Reverse nearest neighbor queries in fixed dimension [Citation Graph (, )][DBLP]
Reachability by Paths of Bounded Curvature in a Convex Polygon [Citation Graph (, )][DBLP]

Search in 0.002secs, Finished in 0.306secs

NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades

NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP