Pierre Kauffmann

According to our database, Pierre Kauffmann authored at least 3 papers between 1997 and 2000.

Collaborative distances:

• Dijkstra number of six.
• Erdős number of five.

2000

The Construction of Delaunay Diagrams by Lob Reduction.

Pierre Kauffmann, Jean-Claude Spehner

Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2000

1998

A shrinking-circle sweep-algorithm to construct the farthest site delaunay diagram in the plane.

Bruno Adam, Pierre Kauffmann, Dominique Schmitt, Jean-Claude Spehner

Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

1997

An increasing-circle sweep-algorithm to construct the delaunay diagram in the plane.

Bruno Adam, Pierre Kauffmann, Dominique Schmitt, Jean-Claude Spehner

Proceedings of the 9th Canadian Conference on Computational Geometry, 1997