The following pages link to Olivier Devillers (Q203740):
Displayed 50 items.
- Computing a single cell in the overlay of two simple polygons (Q287185) (← links)
- A tight bound for the Delaunay triangulation of points on a polyhedron (Q443906) (← links)
- Perturbations for Delaunay and weighted Delaunay 3D triangulations (Q617544) (← links)
- Vertex removal in two-dimensional Delaunay triangulation: speed-up by low degrees optimization (Q617545) (← links)
- On the asymptotic growth rate of some spanning trees embedded in \(\mathbb R^d\) (Q631214) (← links)
- Incremental algorithms for finding the convex hulls of circles and the lower envelopes of parabolas (Q672261) (← links)
- Evaluating signs of determinants using single-precision arithmetic (Q675307) (← links)
- Oja centers and centers of gravity (Q691766) (← links)
- Expected length of the Voronoi path in a high dimensional Poisson-Delaunay triangulation (Q724951) (← links)
- The monotonicity of \(f\)-vectors of random polytopes (Q742986) (← links)
- Lines tangent to four triangles in three-dimensional space (Q878381) (← links)
- (Q959809) (redirect page) (← links)
- Succinct representations of planar maps (Q959810) (← links)
- On the complexity of umbra and penumbra (Q1028233) (← links)
- Applications of random sampling to on-line algorithms in computational geometry (Q1192610) (← links)
- Fully dynamic Delaunay triangulation in logarithmic expected per operation (Q1199828) (← links)
- Computing the maximum overlap of two convex polygons under translations (Q1271283) (← links)
- A probabilistic analysis of the power of arithmetic filters (Q1275677) (← links)
- Checking the convexity of polytopes and the planarity of subdivisions (Q1276945) (← links)
- An introduction to randomization in computational geometry (Q1351693) (← links)
- Chromatic variants of the Erdős--Szekeres theorem on points in convex position. (Q1410590) (← links)
- The number of cylindrical shells (Q1434253) (← links)
- Triangulations in CGAL (Q1602941) (← links)
- Algebraic methods and arithmetic filtering for exact predicates on circle arcs (Q1602945) (← links)
- Rounding Voronoi diagram (Q1603650) (← links)
- Further results on arithmetic filters for geometric predicates (Q1807652) (← links)
- Splitting a Delaunay triangulation in linear time (Q1849762) (← links)
- Circular cylinders through four or five points in space (Q1864130) (← links)
- An algorithm for constructing the convex hull of a set of spheres in dimension \(d\) (Q1917048) (← links)
- Queries on Voronoi diagrams on moving points (Q1924716) (← links)
- Convex tours of bounded curvature (Q1961381) (← links)
- Removing degeneracies by perturbing the problem or perturbing the world (Q1971097) (← links)
- Randomized incremental construction of Delaunay triangulations of nice point sets (Q2039315) (← links)
- Rounding meshes in 3D (Q2189740) (← links)
- Homological reconstruction and simplification in \(\mathbb{R}^3\) (Q2354925) (← links)
- A semidynamic construction of higher-order Voronoi diagrams and its randomized analysis (Q2366225) (← links)
- Inner and outer rounding of Boolean operations on lattice polygonal regions (Q2575584) (← links)
- Practical distribution-sensitive point location in triangulations (Q2637075) (← links)
- Efficiently navigating a random Delaunay triangulation (Q2789543) (← links)
- Vertex Deletion for 3D Delaunay Triangulations (Q2849315) (← links)
- CATALOG-BASED REPRESENTATION OF 2D TRIANGULATIONS (Q2893456) (← links)
- Recognizing Shrinkable Complexes Is NP-Complete (Q2921395) (← links)
- (Q2934705) (← links)
- Monotone Simultaneous Embeddings of Paths in d Dimensions (Q2961545) (← links)
- (Q2968075) (← links)
- Hyperbolic Delaunay complexes and Voronoi diagrams made practical (Q2968110) (← links)
- The worst visibility walk in a random Delaunay triangulation is $O(\sqrt{n})$ (Q2970456) (← links)
- (Q2970458) (← links)
- (Q2970468) (← links)
- THE DELAUNAY HIERARCHY (Q3021945) (← links)