Jean-Claude Spehner

Fundam. Informaticae, 2013

2011

Centroid Triangulations from k-Sets.

[BibT_eX]

[DOI]

Wael El Oraiby

Int. J. Comput. Geom. Appl., 2011

2007

Erratum for "Shuffle of Words and Araucaria Trees".

[BibT_eX]

[DOI]

Fundam. Informaticae, 2007

2006

Shuffle of Words and Araucaria Trees.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2006

k-set polytopes and order-k Delaunay diagrams.

[BibT_eX]

[DOI]

Proceedings of the 3rd International Symposium on Voronoi Diagrams in Science and Engineering, 2006

2004

Two optimal parallel algorithms on the commutation class of a word.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

On the Minimal Automaton of the Shuffle of Words and Araucarias.

[BibT_eX]

[DOI]

Proceedings of the Machines, Computations, and Universality, 4th International Conference, 2004

2000

The Construction of Delaunay Diagrams by Lob Reduction.

[BibT_eX]

[DOI]

Pierre Kauffmann

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

1999

Angular Properties of Delaunay Diagrams in Any Dimension.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1999

1998

Order-k Voronoi Diagrams, k-Sections, and k-Sets.

[BibT_eX]

[DOI]

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

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

[BibT_eX]

[DOI]

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

1997

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

[BibT_eX]

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

1996

Meta-Resolution: An Algorithmic Formalisation.

[BibT_eX]

[DOI]

Jean-Denis Fouks

Theor. Comput. Sci., 1996

1995

Fast and Robust Computation of Molecular Surfaces.

[BibT_eX]

[DOI]

Michel F. Sanner

Arthur J. Olson

Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995

1994

A Bijection Between Cliques in Graphs and Factorizations in Free Monoids.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1994

1993

On Equiangularity of Delaunay Diagrams in Every Dimension.

[BibT_eX]

Proceedings of the 5th Canadian Conference on Computational Geometry, 1993

1991

Merging in Maps and in Pavings.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1991

1990

Construction of Voronoi Diagrams in the Plane by Using Maps.

[BibT_eX]

[DOI]

Mounir Elbaz

Theor. Comput. Sci., 1990

1988

La Reconnaissance des Facteurs d'un Langage Fini dans un Texte en Temps Lineaire.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1988

La Reconnaissance des Facteurs d'un Language Fini dans un Texte en Temps Lineaire (Resume).

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 15th International Colloquium, 1988

1986

La Reconnaissance des Facteurs d'un Mot dans un Texte.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1986

Le Calcul Rapide des Melanges de Deux Mots.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1986

Un Algorithme Determinant les Melanges de Deux Mots.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 13th International Colloquium, 1986

1985

Systèmes Entiers d'Équations sur un Alphabet Fini et Conjecture d'Ehrenfeucht.

[BibT_eX]

[DOI]