works on

From the 1 of 5.5k papers with an AI index.

most citedQuantum ESPRESSO: a modular and open-source software project for quantum simulations of materials

29.3k citations

Showing 1999Show all

9 papers · 1 filter

cs.CG1999★ 3 cited

Finding an ordinary conic and an ordinary hyperplane

Olivier Devillers, Asish Mukhopadhyay

Given a finite set of non-collinear points in the plane, there exists a line that passes through exactly two points. Such a line is called an ordinary line. An efficient algorithm…

cs.CG1999★ 11 cited

Circular Separability of Polygons

Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers +1

Two planar sets are circularly separable if there exists a circle enclosing one of the sets and whose open interior disk does not intersect the other set. This paper studies two pr…

cs.CG1999★ 22 cited

Computing largest circles separating two sets of segments

Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers +2

A circle separates two planar sets if it encloses one of the sets and its open interior disk does not meet the other set. A separating circle is a largest one if it cannot be l…

cs.CG1999★ 111 cited

Convex Tours of Bounded Curvature

Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers +2

We consider the motion planning problem for a point constrained to move along a smooth closed convex path of bounded curvature. The workspace of the moving point is bounded by a co…

cs.CG1999★ 1 cited

A Probabilistic Analysis of the Power of Arithmetic Filters

Olivier Devillers, Franco P. Preparata

The assumption of real-number arithmetic, which is at the basis of conventional geometric algorithms, has been seriously challenged in recent years, since digital computers do not…

cs.CG1999

Further Results on Arithmetic Filters for Geometric Predicates

Olivier Devillers, Franco P. Preparata

An efficient technique to solve precision problems consists in using exact computations. For geometric predicates, using systematically expensive exact computations can be avoided…