M. Teillaud

Publications
Influence

Jean-Daniel Boissonnat, O. Devillers, S. Pion, M. Teillaud, M. Yvinec
Computer Science, Mathematics
Comput. Geom.
1 May 2002

This paper presents the main algorithmic and design choices that have been made to implement triangulations in the computational geometry algorithms library Cgal. Expand

Applications of random sampling to on-line algorithms in computational geometry

Jean-Daniel Boissonnat, O. Devillers, R. Schott, M. Teillaud, M. Yvinec
Mathematics, Computer Science
Discret. Comput. Geom.
1 December 1992

This paper presents a general framework for the design and randomized analysis of geometric algorithms. Expand

Effective computational geometry for curves and surfaces

Jean-Daniel Boissonnat, M. Teillaud
Computer Science
2006

We report on the effects of a filter based on modular arithmetic that has been introduced recently into the EXACUS library. Expand

Walking in a Triangulation

O. Devillers, S. Pion, M. Teillaud
Computer Science
Int. J. Found. Comput. Sci.
1 April 2002

Given a triangulation in the plane or tetrahedralization in 3-space, we investigate the efficiency of locating a point by walking in the structure with different strategies. Expand

Walking in a triangulation

O. Devillers, S. Pion, M. Teillaud
Computer Science
SCG '01
1 June 2001

We investigate the efficiency of locating a point in a triangulation by walking in the structure with different strategies. Expand

Alpha, Betti and the Megaparsec Universe: On the Topology of the Cosmic Web

R. Weygaert, G. Vegter, +13 authors M. Teillaud
Physics, Computer Science
Trans. Comput. Sci.
16 June 2013

We study the topology of the Megaparsec Cosmic Web in terms of the scale-dependent Betti numbers, which formalize the topological information content of the cosmic mass distribution. Expand

On the Randomized Construction of the Delaunay Tree

Jean-Daniel Boissonnat, M. Teillaud
Computer Science, Mathematics
Theor. Comput. Sci.
10 May 1993

We prove that a randomized construction of the Delaunay triangulation of a finite set of n points in any dimension can be done in O(n log n) expected time in the plane. Expand

Perturbations and vertex removal in a 3D delaunay triangulation

O. Devillers, M. Teillaud
Mathematics, Computer Science
SODA '03
12 January 2003

We propose a simple method that allows to remove any vertex in a three-dimensional Delaunay triangulation even when the points are in very degenerate configurations. Expand

Towards and open curved kernel

I. Emiris, Athanasios Kakargias, S. Pion, M. Teillaud, E. Tsigaridas
Mathematics, Computer Science
SCG '04
8 June 2004

Our work goes towards answering the growing need for the robust and efficient manipulation of curved objects in numerous applications. Expand

On the absolute quadratic complex and its application to autocalibration

J. Ponce, K. McHenry, T. Papadopoulo, M. Teillaud, B. Triggs
Mathematics, Computer Science
IEEE Computer Society Conference on Computer…
20 June 2005

We introduce the absolute quadratic complex formed by all lines that intersect the absolute conic. Expand

Recommended Authors