Applications of random sampling to on-line algorithms in computational geometry . Discrete and Computational Geometry ,
URL : https://hal.archives-ouvertes.fr/inria-00075274
Triangulating a simple polygon in linear time, IEEE Symposium on Foundations of Computer Science, pp.220-230, 1990. ,
Applications of random sampling in computational geometry, II. Discrete and Computational Geometry, 1989. ,
On levels in arrangements and voronoi diagrams, Discrete & Computational Geometry, vol.1, issue.3, pp.307-338, 1991. ,
DOI : 10.1007/BF02574692
On the construction of abstract ,
A semi-dynamic construction of higher order Vorono¨?Vorono¨? diagrams and its randomized analysis. Algorithmica . To be published, Abstract published in Second Canadian Conference on Computational Geometry, 1990. ,
Randomized incremental construction of Delaunay and Vorono¨?Vorono¨? diagrams. Algorithmica ,
Fully dynamic Delaunay triangulation in logarithmic expected time per operation. Computational Geometry Theory and Applications ,
URL : https://hal.archives-ouvertes.fr/hal-01180164
Four results on randomized incremental constructions, 1991. ,
Dynamic maintenance of geometric structures made easy, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science, 1991. ,
DOI : 10.1109/SFCS.1991.185369
A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons, Computational Geometry, vol.1, issue.1, 1991. ,
DOI : 10.1016/0925-7721(91)90012-4
On the randomized construction of the Delaunay tree. Theoretical Computer Science ,
URL : https://hal.archives-ouvertes.fr/inria-00075419
On k-nearest neighbor Vorono¨?Vorono¨? diagrams in the plane, IEEE Transactions on Computers, issue.31, pp.478-487, 1982. ,
Computational Geometry : an Introduction, 1985. ,
DOI : 10.1007/978-1-4612-1098-6
A linear-time algorithm for computing the voronoi diagram of a convex polygon, Discrete & Computational Geometry, vol.9, issue.6, pp.591-604, 1989. ,
DOI : 10.1007/BF02187749
A simple randomized linear time algorithm for computing the Vorono¨?Vorono¨? diagram of a convex polygon ,