The following pages link to Antoine Vigneron (Q238451):
Displaying 50 items.
- Realistic roofs over a rectilinear polygon (Q364851) (← links)
- Reachability by paths of bounded curvature in a convex polygon (Q425619) (← links)
- A faster algorithm for computing motorcycle graphs (Q471142) (← links)
- A generalization of the convex Kakeya problem (Q486985) (← links)
- Fitting a step function to a point set (Q547281) (← links)
- Pattern matching in doubling spaces (Q832835) (← links)
- Motorcycle graphs and straight skeletons (Q870459) (← links)
- Maximizing the overlap of two planar convex sets under rigid motions (Q871058) (← links)
- Packing two disks into a polygonal environment. (Q878013) (← links)
- Sparse geometric graphs with small dilation (Q929746) (← links)
- Computing farthest neighbors on a convex polytope. (Q1401257) (← links)
- Polynomial time algorithms for three-label point labeling. (Q1401261) (← links)
- An algorithm for finding a \(k\)-median in a directed tree (Q1607050) (← links)
- Reporting intersections among thick objects. (Q1853186) (← links)
- Covering and piercing disks with two centers (Q1931270) (← links)
- A deterministic algorithm for fitting a step function to a weighted point-set (Q1943605) (← links)
- Approximating a planar convex set using a sparse grid (Q2274483) (← links)
- Faster algorithms for growing prioritized disks and rectangles (Q2330036) (← links)
- Tight bounds for beacon-based coverage in simple rectilinear polygons (Q2330037) (← links)
- Computing the Gromov hyperbolicity of a discrete metric space (Q2345853) (← links)
- A tight lower bound for computing the diameter of a 3D convex polytope (Q2461545) (← links)
- Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets (Q2489540) (← links)
- The Voronoi diagram of curved objects (Q2572594) (← links)
- Matching sets of line segments (Q2662685) (← links)
- Tight Bounds for Beacon-Based Coverage in Simple Rectilinear Polygons (Q2802931) (← links)
- A Faster Algorithm for Computing Straight Skeletons (Q2921412) (← links)
- (Q2934663) (← links)
- THE ALIGNED K-CENTER PROBLEM (Q2999091) (← links)
- REVERSE NEAREST NEIGHBOR QUERIES IN FIXED DIMENSION (Q2999092) (← links)
- Querying Approximate Shortest Paths in Anisotropic Regions (Q3053153) (← links)
- Approximate Shortest Homotopic Paths in Weighted Regions (Q3060765) (← links)
- Computing the Discrete Fréchet Distance with Imprecise Input (Q3060793) (← links)
- Covering and Piercing Disks with Two Centers (Q3104599) (← links)
- Generating Realistic Roofs over a Rectilinear Polygon (Q3104600) (← links)
- Finding Largest Common Point Sets (Q3132918) (← links)
- Navigating Weighted Regions with Scattered Skinny Tetrahedra (Q3459847) (← links)
- Lower Bounds for Geometric Diameter Problems (Q3525782) (← links)
- Space-Time Tradeoffs for Proximity Searching in Doubling Spaces (Q3541079) (← links)
- Fitting a Step Function to a Point Set (Q3541106) (← links)
- Querying approximate shortest paths in anisotropic regions (Q3602857) (← links)
- Approximate Shortest Paths in Anisotropic Regions (Q3631892) (← links)
- (Q4329403) (← links)
- (Q4551356) (← links)
- (Q4551357) (← links)
- Reachability in a Planar Subdivision with Direction Constraints (Q4580090) (← links)
- COMPUTING THE DISCRETE FRÉCHET DISTANCE WITH IMPRECISE INPUT (Q4650089) (← links)
- APPROXIMATE SHORTEST HOMOTOPIC PATHS IN WEIGHTED REGIONS (Q4650092) (← links)
- Computing and Combinatorics (Q4681184) (← links)
- (Q4828928) (← links)
- A Faster Algorithm for Computing Straight Skeletons (Q4962620) (← links)
