The following pages link to Olivier Devillers (Q203740):
Displaying 19 items.
- Walking in a triangulation (Q5361565) (← links)
- The number of lines tangent to arbitrary convex polyhedra in 3D (Q5361653) (← links)
- Inner and outer rounding of set operations on lattice polygonal regions (Q5361698) (← links)
- On the smoothed complexity of convex hulls (Q5368690) (← links)
- Incremental construction of the delaunay triangulation and the delaunay graph in medium dimension (Q5370719) (← links)
- Lines and Free Line Segments Tangent to Arbitrary Three-Dimensional Convex Polyhedra (Q5386212) (← links)
- MAINTAINING VISIBILITY INFORMATION OF PLANAR POINT SETS WITH A MOVING VIEWPOINT (Q5386741) (← links)
- A pedagogic JavaScript program for point location strategies (Q5404441) (← links)
- (Q5442555) (← links)
- Centroidal Voronoi diagrams for isotropic surface remeshing (Q5463312) (← links)
- Qualitative Symbolic Perturbation: Two Applications of a New Geometry-based Perturbation Framework (Q5745394) (← links)
- Helly-type theorems for approximate covering (Q5896959) (← links)
- Graph Drawing (Q5897620) (← links)
- Helly-type theorems for approximate covering (Q5901411) (← links)
- Circular separability of polygons (Q5943827) (← links)
- Covering families of triangles (Q6057469) (← links)
- Optimal line bipartitions of point sets (Q6487424) (← links)
- Computing the maximum overlap of two convex polygons under translations (Q6487432) (← links)
- Computational geometry and discrete computations (Q6567748) (← links)