Antoine Vigneron

Orcid: 0000-0003-3586-3431

According to our database1, Antoine Vigneron authored at least 52 papers between 2000 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Embeddings and near-neighbor searching with constant additive error for hyperbolic spaces.
Comput. Geom., 2025

2024
Maximum Coverage by k Lines.
Symmetry, February, 2024

2022
Coordinated Path Planning through Local Search and Simulated Annealing.
ACM J. Exp. Algorithmics, 2022

2021
Pattern Matching in Doubling Spaces.
Proceedings of the Algorithms and Data Structures - 17th International Symposium, 2021

A Simulated Annealing Approach to Coordinated Motion Planning (CG Challenge).
Proceedings of the 37th International Symposium on Computational Geometry, 2021

2019
Approximating a planar convex set using a sparse grid.
Inf. Process. Lett., 2019

Matching Sets of Line Segments.
Proceedings of the WALCOM: Algorithms and Computation - 13th International Conference, 2019

2017
Finding Largest Common Point Sets.
Int. J. Comput. Geom. Appl., 2017

Faster Algorithms for Growing Prioritized Disks and Rectangles.
Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

Reachability in a Planar Subdivision with Direction Constraints.
Proceedings of the 33rd International Symposium on Computational Geometry, 2017

2016
Tight Bounds for Beacon-Based Coverage in Simple Rectilinear Polygons.
Proceedings of the LATIN 2016: Theoretical Informatics, 2016

2015
Computing the Gromov hyperbolicity of a discrete metric space.
Inf. Process. Lett., 2015

Improved Bounds for Beacon-Based Coverage and Routing in Simple Rectilinear Polygons.
CoRR, 2015

Triangulation Refinement and Approximate Shortest Paths in Weighted Regions.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Navigating Weighted Regions with Scattered Skinny Tetrahedra.
Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

A New Trajectory Similarity Measure for GPS Data.
Proceedings of the 6th ACM SIGSPATIAL International Workshop on GeoStreaming, 2015

2014
Guest Editors' Foreword.
Int. J. Comput. Geom. Appl., 2014

A Faster Algorithm for Computing Straight Skeletons.
Proceedings of the Algorithms - ESA 2014, 2014

2013
A deterministic algorithm for fitting a step function to a weighted point-set.
Inf. Process. Lett., 2013

Realistic roofs over a rectilinear polygon.
Comput. Geom., 2013

A faster algorithm for computing motorcycle graphs.
Proceedings of the Symposium on Computational Geometry 2013, 2013

2012
Reachability by paths of bounded curvature in a convex polygon.
Comput. Geom., 2012

A Generalization of the Convex Kakeya Problem.
Proceedings of the LATIN 2012: Theoretical Informatics, 2012

2011
Reverse Nearest Neighbor Queries in Fixed Dimension.
Int. J. Comput. Geom. Appl., 2011

The Aligned k-Center Problem.
Int. J. Comput. Geom. Appl., 2011

Covering and Piercing Disks with Two Centers.
Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

Generating Realistic Roofs over a Rectilinear Polygon.
Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

2010
Geometric Optimization and Sums of Algebraic Functions.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Approximate Shortest Homotopic Paths in Weighted Regions.
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

Computing the Discrete Fréchet Distance with Imprecise Input.
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

2009
Computing k-Centers On a Line
CoRR, 2009

2008
Sparse geometric graphs with small dilation.
Comput. Geom., 2008

Fitting a Step Function to a Point Set.
Proceedings of the Algorithms, 2008

Space-Time Tradeoffs for Proximity Searching in Doubling Spaces.
Proceedings of the Algorithms, 2008

2007
A Tight Lower Bound for Computing the Diameter of a 3D Convex Polytope.
Algorithmica, 2007

Approximate shortest paths in anisotropic regions.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Querying approximate shortest paths in anisotropic regions.
Proceedings of the 23rd ACM Symposium on Computational Geometry, 2007

2006
Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets.
Comput. Geom., 2006

Lower Bounds for Geometric Diameter Problems.
Proceedings of the LATIN 2006: Theoretical Informatics, 2006

2005
The Voronoi Diagram of Curved Objects.
Discret. Comput. Geom., 2005

Sparse Geometric Graphs with Small Dilation.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

Maximizing the overlap of two planar convex sets under rigid motions.
Proceedings of the 21st ACM Symposium on Computational Geometry, 2005

A practical approach to approximating diameter of point-set in low dimensions.
Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

2004
Approximation Algorithms for Inscribing or Circumscribing an Axially Symmetric Polygon to a Convex Polygon.
Proceedings of the Computing and Combinatorics, 10th Annual International Conference, 2004

2003
Polynomial time algorithms for three-label point labeling.
Theor. Comput. Sci., 2003

Reporting intersections among thick objects.
Inf. Process. Lett., 2003

2002
Motorcycle graphs and straight skeletons.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

2001
Computing Farthest Neighbors on a Convex Polytope.
Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001

Packing Two Disks into a Polygonal Environment.
Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001

2000
An algorithm for finding a k-median in a directed tree.
Inf. Process. Lett., 2000

Reachability by paths of bounded curvature in convex polygons.
Proceedings of the Sixteenth Annual Symposium on Computational Geometry, 2000

An Elementary Algorithm for Reporting Intersections of Red/Blue Curve Segments.
Proceedings of the 12th Canadian Conference on Computational Geometry, 2000


  Loading...