Antoine Vigneron

From MaRDI portal
Person:238451

Available identifiers

zbMath Open vigneron.antoineWikidataQ106678720 ScholiaQ106678720MaRDI QIDQ238451

List of research outcomes





PublicationDate of PublicationType
Coordinated Path Planning through Local Search and Simulated Annealing2023-06-26Paper
Pattern matching in doubling spaces2022-03-25Paper
Matching sets of line segments2021-04-14Paper
https://portal.mardi4nfdi.de/entity/Q51362162020-11-25Paper
Tight bounds for beacon-based coverage in simple rectilinear polygons2019-10-18Paper
Faster algorithms for growing prioritized disks and rectangles2019-10-18Paper
Matching sets of line segments2019-10-15Paper
Approximating a planar convex set using a sparse grid2019-09-20Paper
A faster algorithm for computing straight skeletons2018-11-05Paper
Reachability in a planar subdivision with direction constraints2018-08-13Paper
Finding Largest Common Point Sets2018-01-31Paper
Maximizing the overlap of two planar convex sets under rigid motions2017-10-20Paper
Navigating weighted regions with scattered skinny tetrahedra2017-10-20Paper
Triangulation refinement and approximate shortest paths in weighted regions2017-10-05Paper
Reachability by paths of bounded curvature in convex polygons2017-09-29Paper
Tight Bounds for Beacon-Based Coverage in Simple Rectilinear Polygons2016-05-03Paper
Navigating Weighted Regions with Scattered Skinny Tetrahedra2016-01-11Paper
Geometric optimization and sums of algebraic functions2015-08-14Paper
Computing the Gromov hyperbolicity of a discrete metric space2015-05-21Paper
A faster algorithm for computing motorcycle graphs2015-02-17Paper
A generalization of the convex Kakeya problem2015-01-19Paper
Approximate shortest paths in anisotropic regions2014-12-18Paper
A faster algorithm for computing motorcycle graphs2014-11-14Paper
A faster algorithm for computing straight skeletons2014-10-08Paper
Geometric optimization and sums of algebraic functions2014-05-22Paper
Realistic roofs over a rectilinear polygon2013-09-03Paper
A deterministic algorithm for fitting a step function to a weighted point-set2013-03-20Paper
Covering and piercing disks with two centers2013-01-25Paper
Computing the discrete Fréchet distance with imprecise input2012-11-23Paper
APPROXIMATE SHORTEST HOMOTOPIC PATHS IN WEIGHTED REGIONS2012-11-23Paper
A generalization of the convex Kakeya problem2012-06-29Paper
Reachability by paths of bounded curvature in a convex polygon2012-06-08Paper
Generating realistic roofs over a rectilinear polygon2011-12-16Paper
Covering and piercing disks with two centers2011-12-16Paper
Fitting a step function to a point set2011-07-01Paper
THE ALIGNED K-CENTER PROBLEM2011-05-11Paper
REVERSE NEAREST NEIGHBOR QUERIES IN FIXED DIMENSION2011-05-11Paper
Computing the discrete Fréchet distance with imprecise input2010-12-09Paper
Approximate shortest homotopic paths in weighted regions2010-12-09Paper
Querying Approximate Shortest Paths in Anisotropic Regions2010-11-04Paper
Approximate Shortest Paths in Anisotropic Regions2009-06-22Paper
Querying approximate shortest paths in anisotropic regions2009-02-12Paper
Fitting a Step Function to a Point Set2008-11-25Paper
Space-Time Tradeoffs for Proximity Searching in Doubling Spaces2008-11-25Paper
Lower Bounds for Geometric Diameter Problems2008-09-18Paper
Sparse geometric graphs with small dilation2008-06-18Paper
A tight lower bound for computing the diameter of a 3D convex polytope2007-11-28Paper
Packing two disks into a polygonal environment.2007-04-25Paper
Maximizing the overlap of two planar convex sets under rigid motions2007-03-15Paper
Motorcycle graphs and straight skeletons2007-03-12Paper
Algorithms and Computation2006-11-14Paper
Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets2006-04-28Paper
The Voronoi diagram of curved objects2005-11-10Paper
Computing and Combinatorics2005-06-15Paper
https://portal.mardi4nfdi.de/entity/Q48289282004-11-29Paper
Computing farthest neighbors on a convex polytope.2003-08-17Paper
Polynomial time algorithms for three-label point labeling.2003-08-17Paper
Reporting intersections among thick objects.2003-01-21Paper
https://portal.mardi4nfdi.de/entity/Q45513572002-09-05Paper
https://portal.mardi4nfdi.de/entity/Q45513562002-09-05Paper
An algorithm for finding a \(k\)-median in a directed tree2002-07-25Paper
An elementary algorithm for reporting intersections of red/blue curve segments2002-03-14Paper
https://portal.mardi4nfdi.de/entity/Q43294032001-01-01Paper

Research outcomes over time

This page was built for person: Antoine Vigneron