The following pages link to Olivier Devillers (Q203740):
Displaying 50 items.
- WALKING IN A TRIANGULATION (Q3021946) (← links)
- 2D Centroidal Voronoi Tessellations with Constraints (Q3071793) (← links)
- Explicit Array-Based Compact Data Structures for Triangulations (Q3104626) (← links)
- SCALABLE ALGORITHMS FOR BICHROMATIC LINE SEGMENT INTERSECTION PROBLEMS ON COARSE GRAINED MULTICOMPUTERS (Q3126158) (← links)
- Qualitative Symbolic Perturbation (Q3132867) (← links)
- (Q3139120) (← links)
- (Q3579508) (← links)
- (Q3601554) (← links)
- (Q3602883) (← links)
- Predicates for line transversals to lines and line segments in three-dimensional space (Q3602910) (← links)
- COMPUTING THE UNION OF 3-COLORED TRIANGLES (Q3986400) (← links)
- RANDOMIZATION YIELDS SIMPLE O(n <font>log</font><sup>⋆</sup> n) ALGORITHMS FOR DIFFICULT Ω(n) PROBLEMS (Q4016895) (← links)
- (Q4037406) (← links)
- SIMULTANEOUS CONTAINMENT OF SEVERAL POLYGONS: ANALYSIS OF THE CONTACT CONFIGURATIONS (Q4289636) (← links)
- The Expected Number of 3D Visibility Events Is Linear (Q4441895) (← links)
- (Q4471313) (← links)
- Motion Planning of Legged Robots (Q4507346) (← links)
- Dog Bites Postman (Q4513211) (← links)
- OPTIMAL LINE BIPARTITIONS OF POINT SETS (Q4513232) (← links)
- Walking in a Planar Poisson–Delaunay Triangulation: Shortcuts in the Voronoi Path (Q4557734) (← links)
- (Q4560223) (← links)
- Array-based Compact Data Structures for Triangulations: Practical Solutions with Theoretical Guarantees (Q4626294) (← links)
- Canonical Ordering for Graphs on the Cylinder with Applications to Periodic Straight-line Drawings on the Flat Cylinder and Torus (Q4626300) (← links)
- THE SHUFFLING BUFFER (Q4682160) (← links)
- COMPUTING LARGEST CIRCLES SEPARATING TWO SETS OF SEGMENTS (Q4682203) (← links)
- MOTION PLANNING OF LEGGED ROBOTS: THE SPIDER ROBOT PROBLEM (Q4698349) (← links)
- (Q4796184) (← links)
- ON DELETION IN DELAUNAY TRIANGULATIONS (Q4818555) (← links)
- COMPUTING ROUNDNESS IS EASY IF THE SET IS ALMOST ROUND (Q4818558) (← links)
- Culling a Set of Points for Roundness or Cylindricity Evaluations (Q4818581) (← links)
- MINIMAL SET OF CONSTRAINTS FOR 2D CONSTRAINED DELAUNAY RECONSTRUCTION (Q4818601) (← links)
- (Q4848585) (← links)
- OUTPUT SENSITIVE CONSTRUCTION OF THE DELAUNAY TRIANGULATION OF POINTS LYING IN TWO PLANES (Q4880207) (← links)
- (Q4886057) (← links)
- Canonical Ordering for Triangulations on the Cylinder, with Applications to Periodic Straight-Line Drawings (Q4912219) (← links)
- (Q4948734) (← links)
- (Q4952661) (← links)
- Scalable algorithms for bichromatic line segment intersection problems on Coarse Grained Multicomputers (Q5060120) (← links)
- (Q5075759) (← links)
- Checking the convexity of polytopes and the planarity of subdivisions (extended abstract) (Q5096937) (← links)
- 3D snap rounding (Q5115798) (← links)
- Expected Complexity of Routing in $\Theta_6$ and Half-$\Theta_6$ Graphs (Q5120153) (← links)
- Hyperbolic delaunay complexes and voronoi diagrams made practical (Q5174463) (← links)
- Homological reconstruction and simplification in R <sup>3</sup> (Q5174469) (← links)
- Complexity analysis of random geometric structures made simpler (Q5174475) (← links)
- Stretch factor in a planar Poisson–Delaunay triangulation with a large intensity (Q5214990) (← links)
- Simple and Efficient Distribution-Sensitive Point Location in Triangulations (Q5233707) (← links)
- Drawing Kn in Three Dimensions with One Bend per Edge (Q5301393) (← links)
- Triangulations in CGAL (extended abstract) (Q5361509) (← links)
- Algebraic methods and arithmetic filtering for exact predicates on circle arcs (Q5361524) (← links)
