Computing 3D Periodic Triangulations (2009)
Caroli, Manuel, Teillaud, Monique
This work is motivated by the need for software computing 3D periodic triangulations in numerous domains including astronomy, material engineering, biomedical computing, fluid dynamics etc. We design...
Computing 3D Periodic Triangulations (2009)
Caroli, Manuel, Teillaud, Monique
This work is motivated by the need for software computing 3D periodic triangulations in numerous domains including astronomy, material engineering, biomedical computing, fluid dynamics etc. We design...
Computing 3D Periodic Triangulations (2009)
Caroli, Manuel, Teillaud, Monique
This work is motivated by the need for software computing 3D periodic triangulations in numerous domains including astronomy, material engineering, biomedical computing, fluid dynamics etc. We design...
Computing 3D Periodic Triangulations (2009)
Caroli, Manuel, Teillaud, Monique
This work is motivated by the need for software computing 3D periodic triangulations in numerous domains including astronomy, material engineering, biomedical computing, fluid dynamics etc. We design...
Design of the CGAL Spherical Kernel and application to arrangements of circles on a sphere (2009)
De Castro, Pedro, Cazals, Frederic, Loriot, Sebastien, Teillaud, Monique
This paper presents a CGAL kernel for algorithms manipulating 3D spheres, circles, and circular arcs. The paper makes three contributions. First, the mathematics underlying two non trivial predicates...
Design of the CGAL Spherical Kernel and application to arrangements of circles on a sphere (2009)
De Castro, Pedro, Cazals, Frederic, Loriot, Sebastien, Teillaud, Monique
This paper presents a CGAL kernel for algorithms manipulating 3D spheres, circles, and circular arcs. The paper makes three contributions. First, the mathematics underlying two non trivial predicates...
Computing 3D Periodic Triangulations (2009)
Caroli, Manuel, Teillaud, Monique
This work is motivated by the need for software computing 3D periodic triangulations in numerous domains including astronomy, material engineering, biomedical computing, fluid dynamics etc. We design...
Computing 3D Periodic Triangulations (2009)
Caroli, Manuel, Teillaud, Monique
This work is motivated by the need for software computing 3D periodic triangulations in numerous domains including astronomy, material engineering, biomedical computing, fluid dynamics etc. We design...
Computing 3D Periodic Triangulations (2009)
Caroli, Manuel, Teillaud, Monique
This work is motivated by the need for software computing 3D periodic triangulations in numerous domains including astronomy, material engineering, biomedical computing, fluid dynamics etc. We...
Computing 3D Periodic Triangulations (2009)
Caroli, Manuel, Teillaud, Monique
This work is motivated by the need for software computing 3D periodic triangulations in numerous domains including astronomy, material engineering, biomedical computing, fluid dynamics etc. We...
Robust and Efficient Delaunay triangulations of points on or close to a sphere (2009)
Caroli, Manuel, Loriot, Sebastien, Teillaud, Monique, Wormser, Camille
We propose two approaches for computing the Delaunay triangulation of points on a sphere, or of rounded points close to a sphere, both based on the classic incremental algorithm initially designed...
Robust and Efficient Delaunay triangulations of points on or close to a sphere (2009)
Caroli, Manuel, Loriot, Sebastien, Teillaud, Monique, Wormser, Camille
We propose two approaches for computing the Delaunay triangulation of points on a sphere, or of rounded points close to a sphere, both based on the classic incremental algorithm initially designed...
Robust and Efficient Delaunay triangulations of points on or close to a sphere (2009)
Caroli, Manuel, Loriot, Sebastien, Teillaud, Monique, Wormser, Camille
We propose two approaches for computing the Delaunay triangulation of points on a sphere, or of rounded points close to a sphere, both based on the classic incremental algorithm initially designed...
Robust and Efficient Delaunay triangulations of points on or close to a sphere (2009)
Caroli, Manuel, Loriot, Sebastien, Teillaud, Monique, Wormser, Camille
We propose two approaches for computing the Delaunay triangulation of points on a sphere, or of rounded points close to a sphere, both based on the classic incremental algorithm initially designed...
09111 Abstracts Collection -- Computational Geometry (2009)
Agarwal, Pankaj Kumar, Alt, Helmut, Teillaud, Monique
From March 8 to March 13, 2009, the Dagstuhl Seminar 09111 ``Computational Geometry '' was held in Schloss Dagstuhl~--~Leibniz Center for Informatics. During the seminar, several participants...
Lower and upper bounds on the number of empty cylinders and ellipsoids (2009)
Aichholzer, Oswin, Aurenhammer, Franz, Devillers, Olivier, Hackl, Thomas, Teillaud, Monique, Vogtenhuber, Birgit
Given a set S of n points in three dimensions, we study the maximum numbers of quadrics spanned by subsets of points in S in several ways. Among various results we prove that the number of empty...
Lower and upper bounds on the number of empty cylinders and ellipsoids (2009)
Aichholzer, Oswin, Aurenhammer, Franz, Devillers, Olivier, Hackl, Thomas, Teillaud, Monique, Vogtenhuber, Birgit
Given a set S of n points in three dimensions, we study the maximum numbers of quadrics spanned by subsets of points in S in several ways. Among various results we prove that the number of empty...
3. The Curved Kernel 4. The Algebraic Kernel 5. The Arrangement Traits Outline (2008)
Elias Tsigaridas, Ioannis Emiris, Monique Teillaud, Sylvain Pion, Arrangement Of Lines
Abstract Decoupling the Cgal 3D Triangulations from the Underlying Space ∗ (2008)
Manuel Caroli, Nico Kruithof, Monique Teillaud
provides packages to compute triangulations in R 2 and R 3. In this paper we describe a new design for the 3D triangulation package that permits to easily add functionality to compute triangulations...
Pedro Machado, Manhães Castro, Sylvain Pion, Monique Teillaud
Project co-funded by the European Commission within FP6 (2002–2006) under contract nr. IST-006413 An algebraic kernel for circles was released in CGAL 3.2, as part of the CGAL 2D Circular Kernel....
Abstract Perturbations and Vertex Removal (2008)
Olivier Devillers, Monique Teillaud
Though Delaunay triangulations are very well known geometric data structures, the problem of the robust removal of a vertex in a three-dimensional Delaunay triangulation is still a problem in...
Counting Quadrics and Delaunay Triangulations and a new Convex Hull Theorem (2008)
Aicholzer, Oswin, Devillers, Olivier, Aurenhammer, Franz, Hackl, Thomas, Teillaud, Monique, Vogtenhuber, Birgit
Given a set $\cal S$ of $n$ points in three dimensions, we study the maximum numbers of quadrics spanned by subsets of points in $\cal S$ in various ways. We prove that the set of empty or enclosing...
Counting Quadrics and Delaunay Triangulations and a new Convex Hull Theorem (2008)
Aicholzer, Oswin, Devillers, Olivier, Aurenhammer, Franz, Hackl, Thomas, Teillaud, Monique, Vogtenhuber, Birgit
Given a set $\cal S$ of $n$ points in three dimensions, we study the maximum numbers of quadrics spanned by subsets of points in $\cal S$ in various ways. We prove that the set of empty or enclosing...
Published in Computational Geometry Theory and Applications 2:55-80, 1992. (2007)
Olivier Devillers, Stefan Meiser, Monique Teillaud
Once upon a time was a Delaunay tree that wanted to get rid of some site p or murders in the Delaunay tree.
Slices of Minkowski differences and Satellite Antenna Layout (2007)
Jean-daniel Boissonnat, Eelco De Lange, Monique Teillaud
Satellite layout is a very hard task because available space for the instruments is small and the physical constraints on the layout are strong. In this article, we show how some physical layout...
The Space of Spheres, a Geometric Tool to Uni f y Duality Results onVoronoi Diagrams (2007)
Olivier Devillers, Stefan Meiser, Monique Teillaud, Route Deslucioles
L'Espace des Sph`eres, unouti l g'eom'etri queunifiantles r'esultats dedualit'esur l es diagrammes deVoronoi
Theory and Applications. (2007)
Olivier Devillers, Stefan Meiser, Monique Teillaud
Triangulation de Delaunay pleinement dynamique en temps tooyen logarithmique par opalration
Towards Dynamic Randomized Algorithms in Computational Geometry (2007)
E De Recherche, Et En Automatique, Sophia Antipolis, Monique Teillaud, Monique Teillaud
Vers des algorithmes dynamiques randomis'es en g'eom'etrie algorithmique
Reaching a Goal with Directional Uncertainty (2007)
Mark Berg, Mark Berg, Mark Overmars, Mark Overmars, Micha Sharir, Micha Sharir, ...
Overmars 1
1 CGAL: an overview CGAL, the Computational Geometry Algorithms Library (2007)
Jean-daniel Boissonnat, Frank Da, Olivier Devillers, Sylvain Pion, Monique Teillaud, Mariette Yvinec
is a large scaled project funded by the European Community. Its goal is to develop a body of objects and operations commonly used in computational geometry and to make them available to application...
Jean-daniel Boissonnat, Olivier Devillers, Monique Teillaud
The k-Delaunay tree extends the Delaunay tree introduced in [1, 2]. It is a hierarchical data structure that allows the semi-dynamic construction of the higher order Voronoi diagrams of a finite set...
Mark De Berg, Olivier Devillers, Marc Van Kreveld, Otfried Schwarzkopf, Monique Teillaud
Let P be a convex polygon in the plane with n vertices and let Q be a convex polygon with m vertices. We prove that the maximum number of combinatorially distinct placements of Q with respect to P...
Jean-daniel Boissonnat, Olivier Devillers, Monique Teillaud
Communicated by D. T. Lee In this paper, we propose an algorithm to compute the Delaunay triangulation of a set S of n points in 3-dimensional space when the points lie in 2 planes. The algorithm is...
predicates on circle arcs (2007)
Apport De Recherche, Olivier Devillers Alex, Olivier Devillers, Ra Fronville, Bernard Mourrain, Monique Teillaud, ...
The purpose of this paper is to present a new method to design exact geometric predicates in algorithms dealing with curved objects such as circular arcs. We focus on the comparison of the abscissae...
Alexandra Fronville, Olivier Devillers, Olivier Devillers, Ra Fronville, Bernard Mourrain, Bernard Mourrain, ...
apport de recherche
Symbolic Elimination for parallel manipulators (2007)
Luc Tancredi, Luc Tancredi, Monique Teillaud, Monique Teillaud, Olivier Devillers, Olivier Devillers, ...
apport de recherche
Mark De Berg, Mark De Berg, Olivier Devillers, Olivier Devillers, Marc Van Kreveld, Marc Van Kreveld, ...
apport de recherche
Decoupling the CGAL 3D Triangulations from the Underlying Space (2007)
Caroli, Manuel, Kruithof, Nico, Teillaud, Monique
The {\em Computational Geometry Algorithms Library} {\sc Cgal} currently provides packages to compute triangulations in $\mathbb{R}^2$ and $\mathbb{R}^3$. In this paper we describe a new design for...
Decoupling the CGAL 3D Triangulations from the Underlying Space (2007)
Caroli, Manuel, Kruithof, Nico, Teillaud, Monique
The {\em Computational Geometry Algorithms Library} {\sc Cgal} currently provides packages to compute triangulations in $\mathbb{R}^2$ and $\mathbb{R}^3$. In this paper we describe a new design for...
Decoupling the CGAL 3D Triangulations from the Underlying Space (2007)
Caroli, Manuel, Kruithof, Nico, Teillaud, Monique
The {\em Computational Geometry Algorithms Library} {\sc Cgal} currently provides packages to compute triangulations in $\mathbb{R}^2$ and $\mathbb{R}^3$. In this paper we describe a new design for...
Decoupling the CGAL 3D Triangulations from the Underlying Space (2007)
Caroli, Manuel, Kruithof, Nico, Teillaud, Monique
The {\em Computational Geometry Algorithms Library} {\sc Cgal} currently provides packages to compute triangulations in $\mathbb{R}^2$ and $\mathbb{R}^3$. In this paper we describe a new design for...
Si la communauté internationale de géométrie algorithmique a souvent la tentation de s'engouffrer dans des recherches essentiellement théoriques, et en particulier combinatoires, la grande...
Design of the CGAL Spherical Kernel and application to arrangements of circles on a sphere (2007)
Cazals, Frédéric, Loriot, Sébastien, Teillaud, Monique
This paper presents a CGAL kernel for algorithms manipulating 3D spheres, circles, and circular arcs. The paper makes three contributions. First, the design of the kernel concept is developed,...
Design of the CGAL Spherical Kernel and application to arrangements of circles on a sphere (2007)
Cazals, Frédéric, Loriot, Sébastien, Teillaud, Monique
This paper presents a CGAL kernel for algorithms manipulating 3D spheres, circles, and circular arcs. The paper makes three contributions. First, the design of the kernel concept is developed,...
Triangulating the Real Projective Plane (2007)
Aanjaneya, Mridul, Teillaud, Monique
We consider the problem of computing a triangulation of the real projective plane $\mathbb{P}^2$, given a finite point set $\mathcal{P} = \{p_1, p_2,\ldots, p_n\}$ as input. We prove that a...
Triangulating the Real Projective Plane (2007)
Aanjaneya, Mridul, Teillaud, Monique
We consider the problem of computing a triangulation of the real projective plane $\mathbb{P}^2$, given a finite point set $\mathcal{P} = \{p_1, p_2,\ldots, p_n\}$ as input. We prove that a...
Triangulating the Real Projective Plane (2007)
Aanjaneya, Mridul, Teillaud, Monique
We consider the problem of computing a triangulation of the real projective plane P2, given a finite point set S={p1, p2,..., pn} as input. We prove that a triangulation of P2 always exists if at...
Exact and efficient computations on circles in CGAL and applications to VLSI design (2007)
Teillaud, Monique, De Castro, Pedro, Pion, Sylvain
CGAL (Computational Geometry Algorithms Library) is a large collection of geometric objects, data structures and algorithms. CGAL currently offers mostly functionalities for linear objects (points,...
Exact and efficient computations on circles in CGAL and applications to VLSI design (2007)
Teillaud, Monique, De Castro, Pedro, Pion, Sylvain
CGAL (Computational Geometry Algorithms Library) is a large collection of geometric objects, data structures and algorithms. CGAL currently offers mostly functionalities for linear objects (points,...
Exact and efficient computations on circles in CGAL and applications to VLSI design (2007)
De Castro, Pedro, Pion, Sylvain, Teillaud, Monique
CGAL (Computational Geometry Algorithms Library) is a large collection of geometric objects, data structures and algorithms. CGAL currently offers mostly functionalities for linear objects (points,...
Exact and efficient computations on circles in CGAL and applications to VLSI design (2007)
De Castro, Pedro, Pion, Sylvain, Teillaud, Monique
CGAL (Computational Geometry Algorithms Library) is a large collection of geometric objects, data structures and algorithms. CGAL currently offers mostly functionalities for linear objects (points,...
Design of the CGAL Spherical Kernel and application to arrangements of circles on a sphere (2007)
Cazals, Frédéric, Loriot, Sébastien, Teillaud, Monique
This paper presents a CGAL kernel for algorithms manipulating 3D spheres, circles, and circular arcs. The paper makes three contributions. First, the design of the kernel concept is developed,...
Design of the CGAL Spherical Kernel and application to arrangements of circles on a sphere (2007)
Cazals, Frédéric, Loriot, Sébastien, Teillaud, Monique
This paper presents a CGAL kernel for algorithms manipulating 3D spheres, circles, and circular arcs. The paper makes three contributions. First, the design of the kernel concept is developed,...
Si la communauté internationale de géométrie algorithmique a souvent la tentation de s'engouffrer dans des recherches essentiellement théoriques, et en particulier combinatoires, la grande...
Si la communauté internationale de géométrie algorithmique a souvent la tentation de s'engouffrer dans des recherches essentiellement théoriques, et en particulier combinatoires, la grande...
Si la communauté internationale de géométrie algorithmique a souvent la tentation de s'engouffrer dans des recherches essentiellement théoriques, et en particulier combinatoires, la grande...
Decoupling the CGAL 3D Triangulations from the Underlying Space (2007)
Caroli, Manuel, Kruithof, Nico, Teillaud, Monique
The {\em Computational Geometry Algorithms Library} {\sc Cgal} currently provides packages to compute triangulations in $\mathbb{R}^2$ and $\mathbb{R}^3$. In this paper we describe a new design for...
Triangulating the Real Projective Plane (2007)
Aanjaneya, Mridul, Teillaud, Monique
We consider the problem of computing a triangulation of the real projective plane P2, given a finite point set S={p1, p2,..., pn} as input. We prove that a triangulation of P2 always exists if at...
Decoupling the CGAL 3D Triangulations from the Underlying Space (2007)
Caroli, Manuel, Kruithof, Nico, Teillaud, Monique
The {\em Computational Geometry Algorithms Library} {\sc Cgal} currently provides packages to compute triangulations in $\mathbb{R}^2$ and $\mathbb{R}^3$. In this paper we describe a new design for...
Triangulating the Real Projective Plane (2007)
Aanjaneya, Mridul, Teillaud, Monique
We consider the problem of computing a triangulation of the real projective plane P2, given a finite point set S={p1, p2,..., pn} as input. We prove that a triangulation of P2 always exists if at...
Revision of interface specification of algebraic kernel (2007)
Berberich, Eric, Hemmer, Michael, Karavelas, Menelaos I., Teillaud, Monique
Perturbations and Vertex Removal in Delaunay and Regular 3D Triangulations (2006)
Devillers, Olivier, Teillaud, Monique
Though Delaunay and regular triangulations are very well known geometric data structures, the problem of the robust removal of a vertex in a three-dimensional triangulation is actually a problem in...
Perturbations and Vertex Removal in Delaunay and Regular 3D Triangulations (2006)
Devillers, Olivier, Teillaud, Monique
Though Delaunay and regular triangulations are very well known geometric data structures, the problem of the robust removal of a vertex in a three-dimensional triangulation is actually a problem in...
Perturbations and Vertex Removal in Delaunay and Regular 3D Triangulations (2006)
Devillers, Olivier, Teillaud, Monique
Though Delaunay and regular triangulations are very well known geometric data structures, the problem of the robust removal of a vertex in a three-dimensional triangulation is actually a problem in...
Perturbations and Vertex Removal in Delaunay and Regular 3D Triangulations (2006)
Devillers, Olivier, Teillaud, Monique
Though Delaunay and regular triangulations are very well known geometric data structures, the problem of the robust removal of a vertex in a three-dimensional triangulation is actually a problem in...
Perturbations and Vertex Removal in Delaunay and Regular 3D Triangulations (2006)
Devillers, Olivier, Teillaud, Monique
Though Delaunay and regular triangulations are very well known geometric data structures, the problem of the robust removal of a vertex in a three-dimensional triangulation is actually a problem in...
The Offset to an Algebraic Curve and an Application to Conics (2005)
Anton, François, Emiris, Ioannis Z., Mourrain, Bernard, Teillaud, Monique
Curve offsets are important objects in computer-aided design. We study the algebraic properties of the offset to an algebraic curve, thus obtaining a general formula for its degree. This is applied...
On the Computation of an Arrangement of Quadrics in 3D (2005)
Mourrain, Bernard, Técourt, Jean-Pierre, Teillaud, Monique
In this paper, we study a sweeping algorithm for computing the arrangement of a set of quadrics in $\RR^{3}$. We define a ``trapezoidal'' decomposition in the sweeping plane, and we study the...
The Offset to an Algebraic Curve and an Application to Conics (2005)
Anton, François, Emiris, Ioannis Z., Mourrain, Bernard, Teillaud, Monique
Curve offsets are important objects in computer-aided design. We study the algebraic properties of the offset to an algebraic curve, thus obtaining a general formula for its degree. This is applied...
On the Computation of an Arrangement of Quadrics in 3D (2005)
Mourrain, Bernard, Técourt, Jean-Pierre, Teillaud, Monique
In this paper, we study a sweeping algorithm for computing the arrangement of a set of quadrics in $\RR^{3}$. We define a ``trapezoidal'' decomposition in the sweeping plane, and we study the...
An empirical comparison of software for constructing arrangements of curved arcs (2004)
Berberich,Eric, Eigenwillig,Arno, Emiris,Ioannis, Fogel,Efraim, Hemmer,Michael, Halperin,Dan, ...
An empirical comparison of software for constructing arrangements of curved arcs (2004)
Berberich, Eric, Eigenwillig, Arno, Emiris, Ioannis, Fogel, Efraim, Hemmer, Michael, Halperin, Dan, ...
Towards an Open Curved Kernel (2004)
Emiris, Ioannis, Kakargias, Athanasios, Pion, Sylvain, Teillaud, Monique, Tsigaridas, Elias
Our work goes towards answering the growing need for the robust and efficient manipulation of curved objects in numerous applications. The kernel of the CGAL library provides several functionalities...
Towards an Open Curved Kernel (2004)
Emiris, Ioannis, Kakargias, Athanasios, Pion, Sylvain, Teillaud, Monique, Tsigaridas, Elias
Our work goes towards answering the growing need for the robust and efficient manipulation of curved objects in numerous applications. The kernel of the CGAL library provides several functionalities...
Towards an open curved kernel (2004)
Ioannis Z. Emiris, Monique Teillaud, Sophia Antipolis, Athanasios Kakargias
Our work goes towards answering the growing need for the robust and efficient manipulation of curved objects in numerous applications. The kernel of the cgal library provides several functionalities...
Perturbations and Vertex Removal in a 3D Delaunay Triangulation (2003)
Devillers, Olivier, Teillaud, Monique
Though Delaunay triangulations are very well known geometric data structures, the problem of the robust removal of a vertex in a three-dimensional Delaunay triangulation is still a problem in...
Perturbations and Vertex Removal in a 3D Delaunay Triangulation (2003)
Devillers, Olivier, Teillaud, Monique
Though Delaunay triangulations are very well known geometric data structures, the problem of the robust removal of a vertex in a three-dimensional Delaunay triangulation is still a problem in...
Perturbations and Vertex Removal in a 3D Delaunay Triangulation (2002)
Devillers, Olivier, Teillaud, Monique
Though Delaunay triangulations are very well known geometric data structures, the problem of the robust removal of a vertex in a three-dimensional Delaunay triangulation is still a problem in...
Perturbations and Vertex Removal in a 3D Delaunay Triangulation (2002)
Devillers, Olivier, Teillaud, Monique
Though Delaunay triangulations are very well known geometric data structures, the problem of the robust removal of a vertex in a three-dimensional Delaunay triangulation is still a problem in...
Walking in a Triangulation (2002)
Devillers, Olivier, Pion, Sylvain, Teillaud, Monique
Given a triangulation in the plane or a tetrahedralization in 3-space, we investigate the efficiency of locating a point by walking in the structure with different strategies.
Walking in a Triangulation (2002)
Devillers, Olivier, Pion, Sylvain, Teillaud, Monique
Given a triangulation in the plane or a tetrahedralization in 3-space, we investigate the efficiency of locating a point by walking in the structure with different strategies.
Perturbations and Vertex Removal in a 3D Delaunay Triangulation (2002)
Devillers, Olivier, Teillaud, Monique
Though Delaunay triangulations are very well known geometric data structures, the problem of the robust removal of a vertex in a three-dimensional Delaunay triangulation is still a problem in...
Walking in a Triangulation (2002)
Devillers, Olivier, Pion, Sylvain, Teillaud, Monique
Given a triangulation in the plane or a tetrahedralization in 3-space, we investigate the efficiency of locating a point by walking in the structure with different strategies.
Algebraic methods and arithmetic filtering for exact predicates on circle arcs (2002)
Devillers, Olivier, Fronville, Alexandra, Mourrain, Bernard, Teillaud, Monique
The purpose of this paper is to present a new method to design exact geometric predicates in algorithms dealing with curved objects such as circular arcs. We focus on the comparison of the abscissae...
Algebraic methods and arithmetic filtering for exact predicates on circle arcs (2002)
Devillers, Olivier, Fronville, Alexandra, Mourrain, Bernard, Teillaud, Monique
The purpose of this paper is to present a new method to design exact geometric predicates in algorithms dealing with curved objects such as circular arcs. We focus on the comparison of the abscissae...
Boissonnat, Jean-Daniel, Devillers, Olivier, Pion, Sylvain, Teillaud, Monique, Yvinec, Mariette
This paper presents the main algorithmic and design choices that have been made to implement triangulations in the computational geometry algorithms library CGAL.
Boissonnat, Jean-Daniel, Devillers, Olivier, Pion, Sylvain, Teillaud, Monique, Yvinec, Mariette
This paper presents the main algorithmic and design choices that have been made to implement triangulations in the computational geometry algorithms library CGAL.
Perturbations and Vertex Removal in a 3D Delaunay Triangulation (2002)
Unit Inria, Sophia Antipolis, Olivier Devillers, Olivier Devillers, Monique Teillaud, Monique Teillaud, ...
Though Delaunay triangulations are very well known geometric data structures, the problem of the robust removal of a vertex in a three-dimensional Delaunay triangulation is still a problem in...
Splitting a Delaunay Triangulation in Linear Time (2001)
Chazelle, Bernard, Devillers, Olivier, Hurtado, Ferran, Mora, Mercè, Sacristán, Vera, Teillaud, Monique
Computing the Delaunay triangulation of $n$ points requires usually a minimum of $\Omega(n\log n)$ operations, but in some special cases where some additional knowledge is provided, faster algorithms...
Walking in a triangulation (2001)
Devillers, Olivier, Pion, Sylvain, Teillaud, Monique
Given a triangulation in the plane or a tetrahedralization in 3-space, we investigate the efficiency of locating a point by walking in the structure with different strategies.
Splitting a Delaunay Triangulation in Linear Time (2001)
Chazelle, Bernard, Devillers, Olivier, Hurtado, Ferran, Mora, Mercè, Sacristán, Vera, Teillaud, Monique
Computing the Delaunay triangulation of $n$ points requires usually a minimum of $\Omega(n\log n)$ operations, but in some special cases where some additional knowledge is provided, faster algorithms...
Walking in a triangulation (2001)
Devillers, Olivier, Pion, Sylvain, Teillaud, Monique
Given a triangulation in the plane or a tetrahedralization in 3-space, we investigate the efficiency of locating a point by walking in the structure with different strategies.
Splitting a Delaunay Triangulation in Linear Time (2001)
Chazelle, Bernard, Devillers, Olivier, Hurtado, Ferran, Mora, Merce, Sacristan, Vera, Teillaud, Monique
Computing the Delaunay triangulation of n points requires usually a minimum of Omega(n log n) operations, but in some special cases where some additional knowledge is provided, faster algorithms can...
Splitting a Delaunay Triangulation in Linear Time (2001)
Chazelle, Bernard, Devillers, Olivier, Hurtado, Ferran, Mora, Merce, Sacristan, Vera, Teillaud, Monique
Computing the Delaunay triangulation of n points requires usually a minimum of Omega(n log n) operations, but in some special cases where some additional knowledge is provided, faster algorithms can...
Splitting a Delaunay Triangulation in Linear Time (2001)
Chazelle, Bernard, Devillers, Olivier, Hurtado, Ferran, Mora, Mercè, Sacristán, Vera, Teillaud, Monique
Computing the Delaunay triangulation of $n$ points requires usually a minimum of $\Omega(n\log n)$ operations, but in some special cases where some additional knowledge is provided, faster algorithms...
Walking in a triangulation (2001)
Devillers, Olivier, Pion, Sylvain, Teillaud, Monique
Given a triangulation in the plane or a tetrahedralization in 3-space, we investigate the efficiency of locating a point by walking in the structure with different strategies.
Splitting a Delaunay Triangulation in Linear Time (2001)
Chazelle, Bernard, Devillers, Olivier, Hurtado, Ferran, Mora, Merce, Sacristan, Vera, Teillaud, Monique
Computing the Delaunay triangulation of n points requires usually a minimum of Omega(n log n) operations, but in some special cases where some additional knowledge is provided, faster algorithms can...
Walking in a Triangulation (2001)
Devillers, Olivier, Pion, Sylvain, Teillaud, Monique
Given a triangulation in the plane or a tetrahedralization in 3-space, we investigate the efficiency of locating a point by walking in the structure with different strategies.
Walking in a Triangulation (2001)
Devillers, Olivier, Pion, Sylvain, Teillaud, Monique
Given a triangulation in the plane or a tetrahedralization in 3-space, we investigate the efficiency of locating a point by walking in the structure with different strategies.
Walking in a triangulation (2001)
Olivier Devillers, Sylvain Pion, Monique Teillaud
Given a triangulation in the plane or a tetrahedralization in 3-space, we investigate the efficiency of locating a point by walking in the structure with different
Walking in a triangulation (2001)
Olivier Devillers, Olivier Devillers, Sylvain Pion, Sylvain Pion, Monique Teillaud, Monique Teillaud, ...
apport de recherche
Splitting a Delaunay Triangulation in Linear Time (2001)
Bernard Chazelle, Bernard Chazelle, Olivier Devillers, Olivier Devillers, Ferran Hurtado, Ferran Hurtado, ...
Computing the Delaunay triangulation of n points requires usually a minimum of# n log n# operations, but in some special cases where some additional knowledge is provided, faster algorithms can be...
Splitting a Delaunay Triangulation in Linear Time (2001)
Vera Sacristn, Unit Inria, Sophia Antipolis, Bernard Chazelle, Bernard Chazelle, Olivier Devillers, ...
Computing the Delaunay triangulation of n points requires usually a minimum of n log n) operations, but in some special cases where some additional knowledge is provided, faster algorithms can be...
Walking in a Triangulation (2001)
Olivier Devillers, Sylvain Pion, Monique Teillaud, Thème Génie Logiciel, Projets Prisme, ...
Given a triangulation in the plane or a tetrahedralization in 3-space, weinvestigate the e#ciency of locating a pointbywalking in the structure with di#erent strategies. Key-words: Computational...
An Empirical Comparison of Software for Constructing Arrangements of Curved Arcs (2000)
Sylvain Pion, Monique Teillaud, Efraim Fogel, Dan Halperin, Ron Wein, Ioannis Emiris, ...
Arrangements of planar curves are fundamental structures in computational geometry.
Algebraic Methods and Arithmetic Filtering for Exact Predicates on Circle Arcs (1999)
Devillers, Olivier, Fronville, Alexandra, Mourrain, Bernard, Teillaud, Monique
The purpose of this paper is to present a new method to design exact geometric predicates in algorithms dealing with curved objects such as circular arcs. We focus on the comparison of the abscissae...
Algebraic Methods and Arithmetic Filtering for Exact Predicates on Circle Arcs (1999)
Devillers, Olivier, Fronville, Alexandra, Mourrain, Bernard, Teillaud, Monique
The purpose of this paper is to present a new method to design exact geometric predicates in algorithms dealing with curved objects such as circular arcs. We focus on the comparison of the abscissae...
Algebraic Methods and Arithmetic Filtering for Exact Predicates on Circle Arcs (1999)
Devillers, Olivier, Fronville, Alexandra, Mourrain, Bernard, Teillaud, Monique
The purpose of this paper is to present a new method to design exact geometric predicates in algorithms dealing with curved objects such as circular arcs. We focus on the comparison of the abscissae...
Programming with CGAL: the example of triangulations (1999)
Boissonnat, Jean-Daniel, Cazals, Frédéric, Da, Tran Kai Frank, Devillers, Olivier, Pion, Sylvain, Rebufat, Francois, ...
This paper accompanies a video presenting how to develop code using CGAL, in particular, the triangulation classes.
Programming with CGAL: the example of triangulations (1999)
Boissonnat, Jean-Daniel, Cazals, Frédéric, Da, Tran Kai Frank, Devillers, Olivier, Pion, Sylvain, Rebufat, Francois, ...
This paper accompanies a video presenting how to develop code using CGAL, in particular, the triangulation classes.
Three Dimensional Triangulations in CGAL (1999)
This paper describes the design and the implementation of the three-dimensional triangulation package 1 of the Computational Geometric Algorithms Library Cgal 2 . We focus on representation issues...
Computing the Maximum Overlap of Two Convex Polygons Under Translations (1998)
De Berg, Mark, Devillers, Olivier, Van Kreveld, Marc, Schwarzkopf, Otfried, Teillaud, Monique
Let P be a convex polygon in the plane with n vertices and let Q be a convex polygon with m vertices. We prove that the maximum number of combinatorially distinct placements of Q with respect to P...
Computing the maximum overlap of two convex polygons under translations (1998)
De Berg, Mark, Cheong, Otfried, Devillers, Olivier, Van Kreveld, Marc, Teillaud, Monique
Let P be a convex polygon in the plane with n vertices and let Q be a convex polygon with m vertices. We prove that the maximum number of combinatorially distinct placements of Q with respect to P...
Computing the Maximum Overlap of Two Convex Polygons Under Translations. (1998)
Berg, Mark De, Devillers, Olivier, Kreveld, Marc Van, Schwarzkopf, Otfried, Teillaud, Monique
Let P be a convex polygon in the plane with n vertices and let Q be a convex polygon with m vertices. We prove that the maximum number of combinatorially distinct placements of Q with respect to P...
Computing the Maximum Overlap of Two Convex Polygons Under Translations. (1998)
Berg, Mark De, Devillers, Olivier, Kreveld, Marc Van, Schwarzkopf, Otfried, Teillaud, Monique
Let P be a convex polygon in the plane with n vertices and let Q be a convex polygon with m vertices. We prove that the maximum number of combinatorially distinct placements of Q with respect to P...
Minkowski Operations For Satellite Antenna Layout (1997)
Jean-daniel Boissonnat, Eelco De Lange, Monique Teillaud
Satellite layout is a very hard task because available space for the equipments is small and the physical constraints on the layout are strong. In this article, we show how some physical layout...
Minkowski Operations for Satellite Antenna Layout (1996)
Boissonnat, Jean-Daniel, De Lange, Eelco, Teillaud, Monique
Satellite layout is a very hard task because available space for the equipments is small and the physical constraints on the layout are strong. In this article, we show how some physical layout...
Géométrie synthétique et robots parallèles (1996)
Tancredi, Luc, Teillaud, Monique
Le modèle géométrique direct des robots parallèles consiste à déterminer la position et l'orientation de la plate-forme lorsque sont connues les valeurs des variables articulaires servant à...
Computing the Maximum Overlap of Two Convex Polygons Under Translations (1996)
Berg, Mark De, Devillers, Olivier, Kreveld, Marc Van, Schwarzkopf, Otfried, Teillaud, Monique
Let $P$ be a convex polygon in the plane with $n$ vertices and let $Q$ be a convex polygon with $m$ vertices. We prove that the maximum number of combinatorially distinct placements of $Q$ with...
Symbolic Elimination for Parallel Manipulators (1996)
Tancredi, Luc, Teillaud, Monique, Devillers, Olivier
The forward kinematics problem of parallel robot consists in computing the position of a solid moving in the three-dimensional space with six points on it constrained to lie respectively on six given...
Minkowski Operations for Satellite Antenna Layout (1996)
Boissonnat, Jean-Daniel, De Lange, Eelco, Teillaud, Monique
Satellite layout is a very hard task because available space for the equipments is small and the physical constraints on the layout are strong. In this article, we show how some physical layout...
Géométrie synthétique et robots parallèles (1996)
Tancredi, Luc, Teillaud, Monique
Le modèle géométrique direct des robots parallèles consiste à déterminer la position et l'orientation de la plate-forme lorsque sont connues les valeurs des variables articulaires servant à...
Computing the Maximum Overlap of Two Convex Polygons Under Translations (1996)
Berg, Mark De, Devillers, Olivier, Kreveld, Marc Van, Schwarzkopf, Otfried, Teillaud, Monique
Let $P$ be a convex polygon in the plane with $n$ vertices and let $Q$ be a convex polygon with $m$ vertices. We prove that the maximum number of combinatorially distinct placements of $Q$ with...
Symbolic Elimination for Parallel Manipulators (1996)
Tancredi, Luc, Teillaud, Monique, Devillers, Olivier
The forward kinematics problem of parallel robot consists in computing the position of a solid moving in the three-dimensional space with six points on it constrained to lie respectively on six given...
Minkowski Operations for Satellite Antenna Layout (1996)
Boissonnat, Jean-Daniel, De Lange, Eelco, Teillaud, Monique
Satellite layout is a very hard task because available space for the equipments is small and the physical constraints on the layout are strong. In this article, we show how some physical layout...
Géométrie synthétique et robots parallèles (1996)
Tancredi, Luc, Teillaud, Monique
Le modèle géométrique direct des robots parallèles consiste à déterminer la position et l'orientation de la plate-forme lorsque sont connues les valeurs des variables articulaires servant à...
Computing the Maximum Overlap of Two Convex Polygons Under Translations (1996)
Berg, Mark De, Devillers, Olivier, Kreveld, Marc Van, Schwarzkopf, Otfried, Teillaud, Monique
Let $P$ be a convex polygon in the plane with $n$ vertices and let $Q$ be a convex polygon with $m$ vertices. We prove that the maximum number of combinatorially distinct placements of $Q$ with...
Symbolic Elimination for Parallel Manipulators (1996)
Tancredi, Luc, Teillaud, Monique, Devillers, Olivier
The forward kinematics problem of parallel robot consists in computing the position of a solid moving in the three-dimensional space with six points on it constrained to lie respectively on six given...
Symbolic Elimination for Parallel Manipulators (1996)
Luc Tancredi, Luc Tancredi, Monique Teillaud, Monique Teillaud, Olivier Devillers, Olivier Devillers, ...
The forward kinematics problem of parallel robot consists in computing the position of a solid moving in the three-dimensional space with six points on it constrained to lie respectively on six given...
Computing the Maximum Overlap of Two Convex Polygons Under Translations (1996)
Mark De Berg, Mark De Berg, Olivier Devillers, Olivier Devillers, Marc Van Kreveld, Marc Van Kreveld, ...
Let P be a convex polygon in the plane with n vertices and let Q be a convex polygon with m vertices. We prove that the maximum number of combinatorially distinct placements of Q with respect to P...
Minkowski Operations For Satellite Antenna Layout (1996)
Jean-daniel Boissonnat, Jean-daniel Boissonnat, Eelco De Lange, Eelco De Lange, Monique Teillaud, Monique Teillaud
Satellite layout is a very hard task because available space for the equipments is small and the physical constraints on the layout are strong. In this article, we show how some physical layout...
Computing the Maximum Overlap of Two Convex Polygons Under Translations (1996)
Mark De Berg, Otfried Cheong, Olivier Devillers, Marc Van Kreveld, Monique Teillaud
Let P be a convex polygon in the plane with n vertices and let Q be a convex polygon with m vertices. We prove that the maximum number of combinatorially distinct placements of Q with respect to P...
Computing the Maximum Overlap of Two Convex Polygons Under Translations (1996)
Mark De, Mark De Berg, Otfried Cheong, Olivier Devillers, Marc Van Kreveld, Monique Teillaud
Let P be a convex polygon in the plane with n vertices and let Q be a convex polygon with m vertices. We prove that the maximum number of combinatorially distinct placements of Q with respect to P...
Union and Split Operations on Dynamic Trapezoidal Maps (1995)
We propose here algorithms to perform two new operations on an arrangement of line segments in the plane, represented by a trapezoidal map: the split of the map along a given vertical line $D$, and...
Union and Split Operations on Dynamic Trapezoidal Maps (1995)
We propose here algorithms to perform two new operations on an arrangement of line segments in the plane, represented by a trapezoidal map: the split of the map along a given vertical line $D$, and...
Union and Split Operations on Dynamic Trapezoidal Maps (1995)
We propose here algorithms to perform two new operations on an arrangement of line segments in the plane, represented by a trapezoidal map: the split of the map along a given vertical line $D$, and...
Union and Split Operations on Dynamic Trapezoidal Maps (1995)
Monique Teillaud, Monique Teillaud, Projet Prisme
: We propose here algorithms to perform two new operations on an arrangement of line segments in the plane, represented by a trapezoidal map: the split of the map along a given vertical line D, and...
Reaching a goal with directional uncertainty (1994)
De Berg, Mark, Guibas, L., Halperin, D., Schwarzkopf, Otfried, Sharir, Micha, Teillaud, Monique
Reaching a goal with directional uncertainty (1994)
De Berg, Mark, Guibas, Leonidas, Halperin, Dan, Schwarzkopf, Otfried, Sharir, Micha, Teillaud, Monique, ...
Disponible dans les fichiers attachés à ce document
Reaching a goal with directional uncertainty (1994)
De Berg, Mark, Guibas, Leonidas, Halperin, Dan, Schwarzkopf, Otfried, Sharir, Micha, Teillaud, Monique, ...
Disponible dans les fichiers attachés à ce document
Reaching a Goal with Directional Uncertainty (1994)
Monique Teillaud, Mark De Berg, Mark De Berg, Leonidas Guibas, Leonidas Guibas, Dan Halperin, ...
: We study two problems related to planar motion planning for robots with imperfect control, where, if the robot starts a linear movement in a certain commanded direction, we only know that its...
A semidynamic construction of higher-order {Voronoi} diagrams and its randomized analysis (1993)
Boissonnat, Jean-Daniel, Devillers, Olivier, Teillaud, Monique
Thek-Delaunay tree extends the Delaunay tree introduced in [1], and [2]. It is a hierarchical data structure that allows the semidynamic construction of the higher-order Voronoi diagrams of a finite...
A semidynamic construction of higher-order {Voronoi} diagrams and its randomized analysis (1993)
Boissonnat, Jean-Daniel, Devillers, Olivier, Teillaud, Monique
Thek-Delaunay tree extends the Delaunay tree introduced in [1], and [2]. It is a hierarchical data structure that allows the semidynamic construction of the higher-order Voronoi diagrams of a finite...
A semidynamic construction of higher-order {Voronoi} diagrams and its randomized analysis (1993)
Boissonnat, Jean-Daniel, Devillers, Olivier, Teillaud, Monique
Thek-Delaunay tree extends the Delaunay tree introduced in [1], and [2]. It is a hierarchical data structure that allows the semidynamic construction of the higher-order Voronoi diagrams of a finite...
Towards dynamic randomized algorithms in computational geometry (1992)
Computational geometry aims to design and analyze algorithms for solving geometric problem. It is a recent field of theorical computer science, that rapidly developed since it appeared in M.I Shamos'...
The space of spheres, a geometric tool to unify duality results on Voronoi diagrams (1992)
Devillers, Olivier, Meiser, S., Teillaud, Monique
We present a framework that allows to easily derive transformations for various kinds of Voronoi and Power diagrams including k-th order and weighted versions. All proofs are essentially geometric...
Summary in French.
Towards dynamic randomized algorithms in computational geometry (1992)
Computational geometry aims to design and analyze algorithms for solving geometric problem. It is a recent field of theorical computer science, that rapidly developed since it appeared in M.I Shamos'...
The space of spheres, a geometric tool to unify duality results on Voronoi diagrams (1992)
Devillers, Olivier, Meiser, Stefan, Teillaud, Monique
We present a framework that allows to easily derive transformations for various kinds of Voronoi and Power diagrams including k-th order and weighted versions. All proofs are essentially geometric...
Fully dynamic Delaunay triangulation in logarithmic expected time per operation (1992)
Devillers, Olivier, Meiser, Stefan, Teillaud, Monique
The Delaunay Tree is a hierarchical data structure that has been introduced in \cite{BT} and analyzed in \cite{deltree,idag}. For a given set of sites S in the plane and an order of insertion for...
Applications of random sampling to on-line algorithms in computational geometry (1992)
Boissonnat, Jean-Daniel, Devillers, Olivier, Schott, René, Teillaud, Monique, Yvinec, Mariette
This paper presents a general framework for the design and randomized analysis of geometric algorithms. These algorithms are on-line and the framework provides general bounds for their expected space...
Applications of random sampling to on-line algorithms in computational geometry (1992)
Boissonnat, Jean-Daniel, Devillers, Olivier, Schott, René, Teillaud, Monique, Yvinec, Mariette
This paper presents a general framework for the design and randomized analysis of geometric algorithms. These algorithms are on-line and the framework provides general bounds for their expected space...
Fully dynamic Delaunay triangulation in logarithmic expected time per operation (1992)
Devillers, Olivier, Meiser, Stefan, Teillaud, Monique
The Delaunay Tree is a hierarchical data structure that has been introduced in \cite{BT} and analyzed in \cite{deltree,idag}. For a given set of sites S in the plane and an order of insertion for...
Towards dynamic randomized algorithms in computational geometry (1992)
Computational geometry aims to design and analyze algorithms for solving geometric problem. It is a recent field of theorical computer science, that rapidly developed since it appeared in M.I Shamos'...
The space of spheres, a geometric tool to unify duality results on Voronoi diagrams (1992)
Devillers, Olivier, Meiser, Stefan, Teillaud, Monique
We present a framework that allows to easily derive transformations for various kinds of Voronoi and Power diagrams including k-th order and weighted versions. All proofs are essentially geometric...
Applications of random sampling to on-line algorithms in computational geometry (1992)
Boissonnat, Jean-Daniel, Devillers, Olivier, Schott, René, Teillaud, Monique, Yvinec, Mariette
This paper presents a general framework for the design and randomized analysis of geometric algorithms. These algorithms are on-line and the framework provides general bounds for their expected space...
Fully dynamic Delaunay triangulation in logarithmic expected time per operation (1992)
Devillers, Olivier, Meiser, Stefan, Teillaud, Monique
The Delaunay Tree is a hierarchical data structure that has been introduced in \cite{BT} and analyzed in \cite{deltree,idag}. For a given set of sites S in the plane and an order of insertion for...
Applications of random sampling to on-line algorithms in computational geometry (1992)
Jean-daniel Boissonnat, Olivier Devillerst, Ren Schott, Monique Teillaud, Mariette Yvinecs
Application de l'chantillonage alatoire aux algorithmes gomtriques en ligne
Dynamic location in an arrangement of line segments in the plane (1992)
Devillers, Olivier, Teillaud, Monique, Yvinec, Mariette
We describe in this paper an algorithm which dynamically maintains the trapezoidal map of an arrangement of line segments. This algorithm is a generalization of the Influence Graph data structure...
Dynamic location in an arrangement of line segments in the plane (1992)
Devillers, Olivier, Teillaud, Monique, Yvinec, Mariette
We describe in this paper an algorithm which dynamically maintains the trapezoidal map of an arrangement of line segments. This algorithm is a generalization of the Influence Graph data structure...
Output sensitive construction of the 3D Delaunay triangulation of constrained sets of points (1991)
Boissonnat, Jean-Daniel, Cerezo, A., Devillers, Olivier, Teillaud, Monique
Dynamic location in an arrangement of line segments in the plane (1991)
Devillers, Olivier, Teillaud, Monique, Yvinec, Mariette
Disponible dans les fichiers attachés à ce document
Output sensitive construction of the 3D Delaunay triangulation of constrained sets of points (1991)
Boissonnat, Jean-Daniel, Cerezo, André, Devillers, Olivier, Teillaud, Monique
Disponible dans les fichiers attachés à document
Dynamic location in an arrangement of line segments in the plane (1991)
Devillers, Olivier, Teillaud, Monique, Yvinec, Mariette
Disponible dans les fichiers attachés à ce document
Output sensitive construction of the 3D Delaunay triangulation of constrained sets of points (1991)
Boissonnat, Jean-Daniel, Cerezo, André, Devillers, Olivier, Teillaud, Monique
Disponible dans les fichiers attachés à document
On The Randomized Construction Of The Delaunay Tree (1991)
E De Recherche, En Informatique, Et En Automatique, Sophia Antipolis, Jean-daniel Boissonnat, Jean-daniel Boissonnat, ...
The Delaunay Tree is a hierarchical data structure that was introduced in [BT86]. It is defined from the Delaunay triangulation and, roughly speaking, represents a triangulation as a hierarchy of...
Applications of random sampling to on-line algorithms in computational geometry (1990)
Boissonnat, Jean-Daniel, Devillers, Olivier, Schott, Rene, Teillaud, Monique, Yvinec, Mariette
A dynamic construction of higher order Voronoi diagrams and its randomized analysis (1990)
Boissonnat, Jean-Daniel, Devillers, Olivier, Teillaud, Monique
O(kd+2n ë[??]õlog n) et une place memoire O(kd+1n ë[??]õlog n). L'algorithme est simple et des resultats experimentaux sont presentes.
Fully dynamic Delaunay triangulation in logarithmic expected time per operation (1990)
Devillers, Olivier, Meiser, Stéphane, Teillaud, Monique
Disponible dans les fichiers attachés à ce document
Applications of random sampling to on-line algorithms in computational geometry (1990)
Boissonnat, Jean-Daniel, Devillers, Olivier, Schott, Rene, Teillaud, Monique, Yvinec, Mariette
Disponible dans les fichiers attachés à ce document
A dynamic construction of higher order Voronoi diagrams and its randomized analysis (1990)
Boissonnat, Jean-Daniel, Devillers, Olivier, Teillaud, Monique
Disponible dans les fichiers attachés à ce document
Fully dynamic Delaunay triangulation in logarithmic expected time per operation (1990)
Devillers, Olivier, Meiser, Stéphane, Teillaud, Monique
Disponible dans les fichiers attachés à ce document
Applications of random sampling to on-line algorithms in computational geometry (1990)
Boissonnat, Jean-Daniel, Devillers, Olivier, Schott, Rene, Teillaud, Monique, Yvinec, Mariette
Disponible dans les fichiers attachés à ce document
A dynamic construction of higher order Voronoi diagrams and its randomized analysis (1990)
Boissonnat, Jean-Daniel, Devillers, Olivier, Teillaud, Monique
Disponible dans les fichiers attachés à ce document
On the randomized construction of the Delaunay tree (1989)
Boissonnat, Jean-Daniel, Teillaud, Monique
The Delaunay is a hierarchical data structure that has been introduced. The Delaunay tree is defined from the Delaunay triangulation and, roughly speaking, represents a triangulation as a hierarchy...
On the randomized construction of the Delaunay tree (1989)
Boissonnat, Jean-Daniel, Teillaud, Monique
The Delaunay is a hierarchical data structure that has been introduced. The Delaunay tree is defined from the Delaunay triangulation and, roughly speaking, represents a triangulation as a hierarchy...