Mariette Yvinec

A generic software design for Delaunay refinement meshing (2006)

This paper introduces a three-dimensional mesh generation algorithm for domains bounded by smooth surfaces. The method combines a surface mesher with a volume mesher, both based on Delaunay...

A generic software design for Delaunay refinement meshing (2006)

This paper describes a generic software designed to implement meshing algorithms based on the Delaunay refinement paradigm. Such a meshing algorithm is generally described through a set of rules...

A generic software design for Delaunay refinement meshing (2006)

This paper describes a generic software designed to implement meshing algorithms based on the Delaunay refinement paradigm. Such a meshing algorithm is generally described through a set of rules...

A generic software design for Delaunay refinement meshing (2006)

This paper describes a generic software designed to implement meshing algorithms based on the Delaunay refinement paradigm. Such a meshing algorithm is generally described through a set of rules...

A generic software design for Delaunay refinement meshing (2006)

This paper describes a generic software designed to implement meshing algorithms based on the Delaunay refinement paradigm. Such a meshing algorithm is generally described through a set of rules...

Anisotropic Diagrams: Labelle Shewchuk approach revisited (2006)

This paper describes a generic software designed to implement meshing algorithms based on the Delaunay refinement paradigm. Such a meshing algorithm is generally described through a set of rules...

Boissonnat, Jean-Daniel, Wormser, Camille, Yvinec, Mariette

F. Labelle and J. Shewchuk have proposed a discrete definition of anisotropic Voronoi diagrams. These diagrams are parametrized by a metric field. Under mild hypotheses on the metric field, such...

Meshing Volumes Bounded by Smooth Surfaces (2006)

Reconstruction with Voronoi Centered Radial Basis Functions (2006)

This paper introduces a three-dimensional mesh generation algorithm for domains bounded by smooth surfaces. The method combines a surface mesher with a volume mesher, both based on Delaunay...

Samozino, Marie, Alexa, Marc, Alliez, Pierre, Yvinec, Mariette

We consider the problem of reconstructing a surface from scattered points sampled on a physical shape. The sampled shape is approximated as the zero level set of a function. This function is defined...

Reconstruction with Voronoi Centered Radial Basis Functions (2006)

Samozino, Marie, Alexa, Marc, Alliez, Pierre, Yvinec, Mariette

We consider the problem of reconstructing a surface from scattered points sampled on a physical shape. The sampled shape is approximated as the zero level set of a function. This function is defined...

Reconstruction with Voronoi Centered Radial Basis Functions (2006)

Samozino, Marie, Alexa, Marc, Alliez, Pierre, Yvinec, Mariette

We consider the problem of reconstructing a surface from scattered points sampled on a physical shape. The sampled shape is approximated as the zero level set of a function. This function is defined...

Reconstruction with Voronoi Centered Radial Basis Functions (2006)

Samozino, Marie, Alexa, Marc, Alliez, Pierre, Yvinec, Mariette

We consider the problem of reconstructing a surface from scattered points sampled on a physical shape. The sampled shape is approximated as the zero level set of a function. This function is defined...

Anisotropic Diagrams: Labelle Shewchuk approach revisited (2005)

Boissonnat, Jean-Daniel, Wormser, Camille, Yvinec, Mariette

F. Labelle and J. Shewchuk have proposed a discrete definition of anisotropic Voronoi diagrams. These diagrams are parametrized by a metric field. Under mild hypotheses on the metric field, such...

Variational tetrahedral meshing (2005)

This paper introduces a three-dimensional mesh generation algorithm for domains bounded by smooth surfaces. The method combines a surface mesher with a volume mesher, both based on Delaunay...

Alliez, Pierre, Cohen-Steiner, David, Yvinec, Mariette, Desbrun, Mathieu

In this paper, a novel Delaunay-based variational approach to isotropic tetrahedral meshing is presented. To achieve both robustness and efficiency, we minimize a simple mesh-dependent energy through...

This paper introduces a three-dimensional mesh generation algorithm for domains bounded by smooth surfaces. The algorithm combines a Delaunay-based surface mesher with a Ruppert-like volume mesher,...

This paper introduces a three-dimensional mesh generation algorithm for domains bounded by smooth surfaces. The algorithm combines a Delaunay-based surface mesher with a Ruppert-like volume mesher,...

Variational Tetrahedral Meshing (2005)

This paper introduces a three-dimensional mesh generation algorithm for domains bounded by smooth surfaces. The algorithm combines a Delaunay-based surface mesher with a Ruppert-like volume mesher,...

Alliez, Pierre, Cohen-Steiner, David, Yvinec, Mariette, Desbrun, Mathieu

In this paper, a novel Delaunay-based variational approach to isotropic tetrahedral meshing is presented. To achieve both robustness and efficiency, we minimize a simple mesh-dependent energy through...

Variational Tetrahedral Meshing (2005)

Alliez, Pierre, Cohen-Steiner, David, Yvinec, Mariette, Desbrun, Mathieu

In this paper, a novel Delaunay-based variational approach to isotropic tetrahedral meshing is presented. To achieve both robustness and efficiency, we minimize a simple mesh-dependent energy through...

Delaunay Triangulation Based Surface Reconstruction : a short survey (2004)

Cazals, Frédéric, Giesen, Joachim, Yvinec, Mariette

Surface reconstruction consists in computing a model that approximates a surface which is known only through a finite sampling. This document is a short survey on surface reconstruction methods based...

Delaunay Triangulation Based Surface Reconstruction : a short survey (2004)

Cazals, Frédéric, Giesen, Joachim, Yvinec, Mariette

Surface reconstruction consists in computing a model that approximates a surface which is known only through a finite sampling. This document is a short survey on surface reconstruction methods based...

Delaunay Triangulation Based Surface Reconstruction : a short survey (2004)

Cazals, Frédéric, Giesen, Joachim, Yvinec, Mariette

Surface reconstruction consists in computing a model that approximates a surface which is known only through a finite sampling. This document is a short survey on surface reconstruction methods based...

The Voronoi Diagram of Convex Objects in the Plane (2003)

Karavelas, Menelaos, Yvinec, Mariette

This paper presents a dynamic algorithm for the construction of the Euclidean Voronoi diagram of a set of convex objects in the plane. We consider first the Voronoi diagram of smooth convex objects...

The Voronoi Diagram of Convex Objects in the Plane (2003)

Karavelas, Menelaos, Yvinec, Mariette

This paper presents a dynamic algorithm for the construction of the Euclidean Voronoi diagram of a set of convex objects in the plane. We consider first the Voronoi diagram of smooth convex objects...

The Voronoi Diagram of Planar Convex Objects (2003)

Karavelas, Memelaos, Yvinec, Mariette

This paper presents a dynamic algorithm for the construction of the Euclidean Voronoi diagram of a set of convex objects in the plane. We consider first the Voronoi diagram of smooth convex objects...

The Voronoi Diagram of Planar Convex Objects (2003)

Karavelas, Memelaos, Yvinec, Mariette

This paper presents a dynamic algorithm for the construction of the Euclidean Voronoi diagram of a set of convex objects in the plane. We consider first the Voronoi diagram of smooth convex objects...

The Voronoi Diagram of Convex Objects in the Plane (2003)

Karavelas, Menelaos, Yvinec, Mariette

This paper presents a dynamic algorithm for the construction of the Euclidean Voronoi diagram of a set of convex objects in the plane. We consider first the Voronoi diagram of smooth convex objects...

The Voronoi Diagram of Planar Convex Objects (2003)

Karavelas, Memelaos, Yvinec, Mariette

This paper presents a dynamic algorithm for the construction of the Euclidean Voronoi diagram of a set of convex objects in the plane. We consider first the Voronoi diagram of smooth convex objects...

The Voronoi diagram of planar convex objects (2003)

Menelaos I. Karavelas, Mariette Yvinec

Abstract. This paper presents a dynamic algorithm for the construction of the Euclidean Voronoi diagram of a set of convex objects in the plane. We consider first the Voronoi diagram of smooth convex...

Dynamic Additively Weighted Voronoi Diagrams in 2D (2002)

Karavelas, Menelaos I., Yvinec, Mariette

In this paper we present a dynamic algorithm for the construction of the additively weighted Voronoi diagram of a set of weighted points on the plane. The novelty in our approach is that we use the...

Conforming Orthogonal Meshes (2002)

Balaven, Sophie, Bennis, Chakib, Boissonnat, Jean-Daniel, Yvinec, Mariette

In this paper, we show how to compute an orthogonal mesh that strictly conforms to a given simplicial complex SC in ^d. This result will be applied to improve the treatment of wells in oil reservoir...

Dynamic Additively Weighted Voronoi Diagrams in 2D (2002)

Karavelas, Menelaos I., Yvinec, Mariette

In this paper we present a dynamic algorithm for the construction of the additively weighted Voronoi diagram of a set of weighted points on the plane. The novelty in our approach is that we use the...

Conforming Orthogonal Meshes (2002)

Balaven, Sophie, Bennis, Chakib, Boissonnat, Jean-Daniel, Yvinec, Mariette

In this paper, we show how to compute an orthogonal mesh that strictly conforms to a given simplicial complex SC in ^d. This result will be applied to improve the treatment of wells in oil reservoir...

Dynamic Additively Weighted Voronoi Diagrams in 2D (2002)

Karavelas, Menelaos I., Yvinec, Mariette

In this paper we present a dynamic algorithm for the construction of the additively weighted Voronoi diagram of a set of weighted points on the plane. The novelty in our approach is that we use the...

Conforming Orthogonal Meshes (2002)

Balaven, Sophie, Bennis, Chakib, Boissonnat, Jean-Daniel, Yvinec, Mariette

In this paper, we show how to compute an orthogonal mesh that strictly conforms to a given simplicial complex SC in ^d. This result will be applied to improve the treatment of wells in oil reservoir...

Triangulations in CGAL (2002)

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.

Triangulations in CGAL (2002)

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.

Conforming Delaunay Triangulations in 3D (2001)

Cohen-Steiner, David, Colin De Verdière, Eric, Yvinec, Mariette

We describe an algorithm which, for any piecewise linear complex (PLC) in 3D, builds a Delaunay triangulation conforming to this PLC. The algorithm has been implemented, and yields in practice a...

Conforming Delaunay Triangulations in 3D (2001)

Cohen-Steiner, David, Colin De Verdière, Eric, Yvinec, Mariette

We describe an algorithm which, for any piecewise linear complex (PLC) in 3D, builds a Delaunay triangulation conforming to this PLC. The algorithm has been implemented, and yields in practice a...

Circular Separability of Polygons (2001)

Boissonnat, Jean-Daniel, Czyzowicz, Jurek, Devillers, Olivier, Yvinec, Mariette

Two planar sets are circularly separable if there exists a circle enclosing one of the set and whose open interior disk does not intersect the other set. This paper studies two problems related to...

Circular Separability of Polygons (2001)

Boissonnat, Jean-Daniel, Czyzowicz, Jurek, Devillers, Olivier, Yvinec, Mariette

Two planar sets are circularly separable if there exists a circle enclosing one of the set and whose open interior disk does not intersect the other set. This paper studies two problems related to...

Conforming Delaunay Triangulations in 3D (2001)

Cohen-Steiner, David, Colin De Verdière, Eric, Yvinec, Mariette

We describe an algorithm which, for any piecewise linear complex (PLC) in 3D, builds a Delaunay triangulation conforming to this PLC. The algorithm has been implemented, and yields in practice a...

Circular Separability of Polygons (2001)

Boissonnat, Jean-Daniel, Czyzowicz, Jurek, Devillers, Olivier, Yvinec, Mariette

Two planar sets are circularly separable if there exists a circle enclosing one of the set and whose open interior disk does not intersect the other set. This paper studies two problems related to...

Computing Largest Circles Separating Two Sets of Segments (2000)

Boissonnat, Jean-Daniel, Czyzowicz, Jurek, Devillers, Olivier, Urrutia, Jorge, Yvinec, Mariette

A circle C separates two planar sets if it encloses one of the sets and its open interior disk does not meet the other set. A separating circle is a largest one if it cannot be locally increased...

Computing Largest Circles Separating Two Sets of Segments (2000)

Boissonnat, Jean-Daniel, Czyzowicz, Jurek, Devillers, Olivier, Urrutia, Jorge, Yvinec, Mariette

A circle C separates two planar sets if it encloses one of the sets and its open interior disk does not meet the other set. A separating circle is a largest one if it cannot be locally increased...

Convex Tours of Bounded Curvature (1999)

Boissonnat, Jean-Daniel, Czyzowicz, Jurek, Devillers, Olivier, Robert, Jean-Marc, Yvinec, Mariette

We consider the motion planning problem for a point constrained to move along a smooth closed convex path of bounded curvature. The workspace of the moving point is bounded by a convex polygon with m...

Computing largest circles separating two sets of segments (1999)

Boissonnat, Jean-Daniel, Czyzowicz, Jurek, Devillers, Olivier, Urrutia, Jorge, Yvinec, Mariette

A circle $C$ separates two planar sets if it encloses one of the sets and its open interior disk does not meet the other set. A separating circle is a largest one if it cannot be locally increased...

Circular Separability of Polygons (1999)

Boissonnat, Jean-Daniel, Czyzowicz, Jurek, Devillers, Olivier, Yvinec, Mariette

Two planar sets are circularly separable if there exists a circle enclosing one of the sets and whose open interior disk does not intersect the other set. This paper studies two problems related to...

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.

Convex Tours of Bounded Curvature. (1999)

Boissonnat, Jean-Daniel, Czyzowicz, Jurek, Devillers, Olivier, Robert, Jean-Marc, Yvinec, Mariette

We consider the motion planning problem for a point constrained to move along a smooth closed convex path of bounded curvature. The workspace of the moving point is bounded by a convex polygon with m...

Convex Tours of Bounded Curvature. (1999)

Boissonnat, Jean-Daniel, Czyzowicz, Jurek, Devillers, Olivier, Robert, Jean-Marc, Yvinec, Mariette

We consider the motion planning problem for a point constrained to move along a smooth closed convex path of bounded curvature. The workspace of the moving point is bounded by a convex polygon with m...

Voronoi Diagrams in Higher Dimensions under Certain Polyhedral Distance Functions (1998)

Jean-daniel Boissonnat, Jean-daniel Boissonnat, Micha Sharir, Micha Sharir, Boaz Tagansky, Boaz Tagansky, ...

The paper bounds the combinatorial complexity of the Voronoi diagram of a set of points under certain polyhedral distance functions. Specifically, if S is a set of n points in general position in...

Voronoi Diagrams in Higher Dimensions under Certain Polyhedral Distance Functions (1998)

Jean-daniel Boissonnat, Micha Sharir, Boaz Tagansky, Mariette Yvinec

The paper bounds the combinatorial complexity of the Voronoi diagram of a set of points under certain polyhedral distance functions. Specifically, if S is a set of n points in general position in IR...

Efficient Exact Evaluation of Signs of Determinants (1997)

Efficient Exact Evaluation of Signs of Determinants (1997)

This paper presents a theoretical and experimental study on two different methods to evaluate the sign of a determinant with integer entries. The first one is a method based on the Gram-Schmidt...

Evaluating signs of determinants using single-precision arithmeti (1997)

This paper presents a theoretical and experimental study on two different methods to evaluate the sign of a determinant with integer entries. The first one is a method based on the Gram-Schmidt...

Avnaim, Francis, Boissonnat, Jean-Daniel, Devillers, Olivier, Preparata, Franco, Yvinec, Mariette

We propose a method to evaluate signs of 2x2 and 3x3 determinants with b-bit integer entries using only b and (b+1)-bit arithmetic respectively. This algorithm has numerous applications in geometric...

Evaluating signs of determinants using single-precision arithmeti (1997)

Avnaim, Francis, Boissonnat, Jean-Daniel, Devillers, Olivier, Preparata, Franco, Yvinec, Mariette

We propose a method to evaluate signs of 2x2 and 3x3 determinants with b-bit integer entries using only b and (b+1)-bit arithmetic respectively. This algorithm has numerous applications in geometric...

Efficient Exact Evaluation of Signs of Determinants (1997)

Evaluating signs of determinants using single-precision arithmeti (1997)

This paper presents a theoretical and experimental study on two different methods to evaluate the sign of a determinant with integer entries. The first one is a method based on the Gram-Schmidt...

Avnaim, Francis, Boissonnat, Jean-Daniel, Devillers, Olivier, Preparata, Franco, Yvinec, Mariette

We propose a method to evaluate signs of 2x2 and 3x3 determinants with b-bit integer entries using only b and (b+1)-bit arithmetic respectively. This algorithm has numerous applications in geometric...

Efficient exact evaluation of signs of determinants (1997)

Herve Brönnimann, Mariette Yvinec

This paper presents a theoretical and experimental study on two dioeerent methods to evaluate the sign of a determinant with integer entries. The rst one is a method based on the Gram-Schmidt...

Efficient exact evaluation of signs of determinants (1997)

Herve Brönnimann, Mariette Yvinec

apport de recherche

Evaluating Signs of Determinants Using Single-Precision Arithmetic (1997)

Jean-daniel Boissonnat, Francis Avnaim, Francis Avnaim, Olivier Devillers, Olivier Devillers, Franco P. Preparata, ...

We propose a method to evaluate signs of 2 × 2 and 3 × 3 determinants with b-bit integer entries using only b and (b + 1)-bit arithmetic respectively. This algorithm has numerous...

A Complete Analysis of Clarkson's Algorithm for Safe Determinant Evaluation (1996)

A Complete Analysis of Clarkson's Algorithm for Safe Determinant Evaluation (1996)

In this paper, we give a complete and self-contained analysis of Clarkson's algorithm that performs safe and efficient determinant evaluation of an $n\times n$ matrix with integer coefficients that...

A Complete Analysis of Clarkson's Algorithm for Safe Determinant Evaluation (1996)

In this paper, we give a complete and self-contained analysis of Clarkson's algorithm that performs safe and efficient determinant evaluation of an $n\times n$ matrix with integer coefficients that...

A complete analysis of Clarkson's algorithm for safe determinant evaluation (1996)

In this paper, we give a complete and self-contained analysis of Clarkson's algorithm that performs safe and efficient determinant evaluation of an $n\times n$ matrix with integer coefficients that...

Hervé Brönnimann, Hervé Brönnimann, Mariette Yvinec, Mariette Yvinec, Thème Génie Logiciel, Projet Prisme, ...

In this paper, we give a complete and self-contained analysis of Clarkson's algorithm that performs safe and efficient determinant evaluation of an n × n matrix with integer...

A complete analysis of Clarkson's algorithm for safe determinant evaluation (1996)

Hervé Brönnimann, Mariette Yvinec, Projet Prisme

In this paper, we give a complete and self-contained analysis of Clarkson's algorithm that performs safe and efficient determinant evaluation of an n × n matrix with integer...

Computing Largest Circles Separating Two Sets of Segments (1996)

Jean-daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Joge Urrutia, Mariette Yvinec

A circle C separates two planar sets if it en closes one of the sets and its open interior disk does not meet the other set. A separating circle is a largest one if it cannot be locally increased...

An Algorithm for Constructing the Convex Hull of a Set of Spheres in Dimension d (1996)

Boissonnat, Jean-Daniel, Cerezo, André, Devillers, Olivier, Duquesne, Jacqueline, Yvinec, Mariette

We present an algorithm which computes the convex hull of a set of spheres in dimension d in time O(n^ceil(d/2)+n log n). It is worst case optimal in three dimensions and in even dimensions. The same...

An Algorithm for Constructing the Convex Hull of a Set of Spheres in Dimension d (1996)

Boissonnat, Jean-Daniel, Cerezo, André, Devillers, Olivier, Duquesne, Jacqueline, Yvinec, Mariette

We present an algorithm which computes the convex hull of a set of spheres in dimension d in time O(n^ceil(d/2)+n log n). It is worst case optimal in three dimensions and in even dimensions. The same...

Computing Largest Circles Separating Two Sets of Segments (1995)

Boissonnat, Jean-Daniel, Czyzowicz, Jurek, Devillers, Olivier, Urrutia, Jorge, Yvinec, Mariette

A circle $C$ separates two planar sets if it encloses one of the sets and its open interior disk does not meet the other set. A separating circle is a largest one if it cannot be locally increased...

Voronoi Diagrams in Higher Dimensions under Certain Polyhedral Distance Functions (1995)

Boissonnat, Jean-Daniel, Sharir, Micha, Tagansky, Boaz, Yvinec, Mariette

The paper bounds the combinatorial complexity of the Voronoi diagram of a set of points under certain polyhedral distance functions. Specifically, if $ß$ is a set of $n$ points in general position...

An Output-Sensitive Convex Hull Algorithm for Planar Objects (1995)

Nielsen, Franck, Yvinec, Mariette

A set of planar objects is said to be of type $m$ if the convex hull of any two objects has its size bounded by $2m$. In this paper, we present an algorithm based on the marriage-before-conquest...

Computing Largest Circles Separating Two Sets of Segments (1995)

Boissonnat, Jean-Daniel, Czyzowicz, Jurek, Devillers, Olivier, Urrutia, Jorge, Yvinec, Mariette

A circle $C$ separates two planar sets if it encloses one of the sets and its open interior disk does not meet the other set. A separating circle is a largest one if it cannot be locally increased...

Voronoi Diagrams in Higher Dimensions under Certain Polyhedral Distance Functions (1995)

Boissonnat, Jean-Daniel, Sharir, Micha, Tagansky, Boaz, Yvinec, Mariette

The paper bounds the combinatorial complexity of the Voronoi diagram of a set of points under certain polyhedral distance functions. Specifically, if $ß$ is a set of $n$ points in general position...

An Output-Sensitive Convex Hull Algorithm for Planar Objects (1995)

Nielsen, Franck, Yvinec, Mariette

A set of planar objects is said to be of type $m$ if the convex hull of any two objects has its size bounded by $2m$. In this paper, we present an algorithm based on the marriage-before-conquest...

Computing Largest Circles Separating Two Sets of Segments (1995)

Boissonnat, Jean-Daniel, Czyzowicz, Jurek, Devillers, Olivier, Urrutia, Jorge, Yvinec, Mariette

A circle $C$ separates two planar sets if it encloses one of the sets and its open interior disk does not meet the other set. A separating circle is a largest one if it cannot be locally increased...

Voronoi Diagrams in Higher Dimensions under Certain Polyhedral Distance Functions (1995)

Boissonnat, Jean-Daniel, Sharir, Micha, Tagansky, Boaz, Yvinec, Mariette

The paper bounds the combinatorial complexity of the Voronoi diagram of a set of points under certain polyhedral distance functions. Specifically, if $ß$ is a set of $n$ points in general position...

An Output-Sensitive Convex Hull Algorithm for Planar Objects (1995)

Nielsen, Franck, Yvinec, Mariette

A set of planar objects is said to be of type $m$ if the convex hull of any two objects has its size bounded by $2m$. In this paper, we present an algorithm based on the marriage-before-conquest...

Computing Largest Circles Separating Two Sets of Segments (1995)

Jorge Urrutia, Jean-daniel Boissonnat, Jean-daniel Boissonnat, Jurek Czyzowicz, Jurek Czyzowicz, Olivier Devillers, ...

A circle C separates two planar sets if it encloses one of the sets and its open interior disk does not meet the other set. A separating circle is a largest one if it cannot be locally increased...

Circular Separability of Polygons (1995)

Mariette Yvinec, Jean-daniel Boissonnat, Jean-daniel Boissonnat, Jurek Czyzowicz, Jurek Czyzowicz, Olivier Devillers, ...

Two planar sets are circularly separable if there exists a circle enclosing one of the set and whose open interior disk does not intersect the other set. This paper studies two problems related to...

An Output-Sensitive Convex Hull Algorithm for Planar Objects (1995)

Franck Nielsen, Franck Nielsen, Mariette Yvinec, Mariette Yvinec, Projet Prisme

: A set of planar objects is said to be of type m if the convex hull of any two objects has its size bounded by 2m. In this paper, we present an algorithm based on the marriage-before-conquest...

Computing Largest Circles Separating Two Sets of Segments (1995)

Jorge Urrutia, Jean-daniel Boissonnat, Jean-daniel Boissonnat, Jurek Czyzowicz, Jurek Czyzowicz, ...

A circle C separates two planar sets if it encloses one of the sets and its open interior disk does not meet the other set. A separating circle is a largest one if it cannot be locally increased...

Boissonnat, Jean-Daniel, Czyzowicz, Jurek, Devillers, Olivier, Robert, Jean-Marc, Yvinec, Mariette

We consider the motion planning problem for a point constrained to move along a smooth closed convex path of bounded curvature. The workspace of the moving point is bounded by a convex polygon with...

Circular Separability of Polygons (1994)

Boissonnat, Jean-Daniel, Czyzowicz, Jurek, Devillers, Olivier, Yvinec, Mariette

Two planar sets are circularly separable if there exists a circle enclosing one of the set and whose open interior disk does not intersect the other set. This paper studies two problems related to...

Evaluating signs of determinants using single-precision arithmetic (1994)

Avnaim, Francis, Boissonnat, Jean-Daniel, Devillers, Olivier, Preparata, Franco P., Yvinec, Mariette

We propose a method to evaluate signs of $2\times 2$ and $3\times 3$ determinants with $b$-bit integer entries using only $b$ and $(b+1)$-bit arithmetic respectively. This algorithm has numerous...

Boissonnat, Jean-Daniel, Czyzowicz, Jurek, Devillers, Olivier, Robert, Jean-Marc, Yvinec, Mariette

We consider the motion planning problem for a point constrained to move along a smooth closed convex path of bounded curvature. The workspace of the moving point is bounded by a convex polygon with...

Circular Separability of Polygons (1994)

Boissonnat, Jean-Daniel, Czyzowicz, Jurek, Devillers, Olivier, Yvinec, Mariette

Two planar sets are circularly separable if there exists a circle enclosing one of the set and whose open interior disk does not intersect the other set. This paper studies two problems related to...

Evaluating signs of determinants using single-precision arithmetic (1994)

Avnaim, Francis, Boissonnat, Jean-Daniel, Devillers, Olivier, Preparata, Franco P., Yvinec, Mariette

We propose a method to evaluate signs of $2\times 2$ and $3\times 3$ determinants with $b$-bit integer entries using only $b$ and $(b+1)$-bit arithmetic respectively. This algorithm has numerous...

Boissonnat, Jean-Daniel, Czyzowicz, Jurek, Devillers, Olivier, Robert, Jean-Marc, Yvinec, Mariette

We consider the motion planning problem for a point constrained to move along a smooth closed convex path of bounded curvature. The workspace of the moving point is bounded by a convex polygon with...

Circular Separability of Polygons (1994)

Boissonnat, Jean-Daniel, Czyzowicz, Jurek, Devillers, Olivier, Yvinec, Mariette

Two planar sets are circularly separable if there exists a circle enclosing one of the set and whose open interior disk does not intersect the other set. This paper studies two problems related to...

Evaluating signs of determinants using single-precision arithmetic (1994)

Avnaim, Francis, Boissonnat, Jean-Daniel, Devillers, Olivier, Preparata, Franco P., Yvinec, Mariette

We propose a method to evaluate signs of $2\times 2$ and $3\times 3$ determinants with $b$-bit integer entries using only $b$ and $(b+1)$-bit arithmetic respectively. This algorithm has numerous...

Convex tours of bounded curvature (1994)

Jean-daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Jean-marc Robert, Mariette Yvinec

We consider the motion planning problem for a point constrained to move along a smooth closed convex path of bounded curvature. The workspace of the moving point is bounded by a convex polygon with m...

Convex tours of bounded curvature (1994)

Jean-daniel Boissonnat, Jean-daniel Boissonnat, Jurek Czyzowicz, Jurek Czyzowicz, Olivier Devillers, Olivier Devillers, ...

We consider the motion planning problem for a point constrained to move along a smooth closed convex path of bounded curvature. The workspace of the moving point is bounded by a convex polygon with m...

Apport De Recherche, Jean-daniel Boissonnat, Jean-daniel Boissonnat, Jurek Czyzowicz, Jurek Czyzowicz, Olivier Devillers, ...

We consider the motion planning problem for a point constrained to move along a smooth closed convex path of bounded curvature. The workspace of the moving point is bounded by a convex polygon with m...

An Algorithm for constructing the convex hull of a set of spheres in dimension d (1993)

Boissonnat, Jean-Daniel, Cerezo, A., Devillers, Olivier, Duquesne, Jacqueline, Yvinec, Mariette

A Complete and efficient algorithm for the intersection of a general ans a convex polyhedron (1993)

An Algorithm for constructing the convex hull of a set of spheres in dimension d (1993)

A polyhedron is any set that can be obtained from the open halfspaces by a finite number of set complement and set intersection operations. We give an efficient and complete algorithm for...

Boissonnat, Jean-Daniel, Cerezo, André, Devillers, Olivier, Duquesne, Jacqueline, Yvinec, Mariette

Disponible dans les fichiers attachés à ce document

A Complete and efficient algorithm for the intersection of a general ans a convex polyhedron (1993)

An Algorithm for constructing the convex hull of a set of spheres in dimension d (1993)

A polyhedron is any set that can be obtained from the open halfspaces by a finite number of set complement and set intersection operations. We give an efficient and complete algorithm for...

Boissonnat, Jean-Daniel, Cerezo, André, Devillers, Olivier, Duquesne, Jacqueline, Yvinec, Mariette

Disponible dans les fichiers attachés à ce document

A Complete and efficient algorithm for the intersection of a general ans a convex polyhedron (1993)

A Complete and Efficient Algorithm for the Intersection of a General and a Convex Polyhedron (1993)

A polyhedron is any set that can be obtained from the open halfspaces by a finite number of set complement and set intersection operations. We give an efficient and complete algorithm for...

Katrin Dobrindt, Katrin Dobrindt, Kurt Mehlhorn, Kurt Mehlhorn, Mariette Yvinec, Mariette Yvinec, ...

: A polyhedron is any set that can be obtained from the open halfspaces by a finite number of set complement and set intersection operations. We give an efficient and complete algorithm for...

A Complete and Efficient Algorithm for the Intersection of a General and a Convex Polyhedron (1993)

Dobrindt, Katrin, Mehlhorn, Kurt, Yvinec, Mariette, Sack, Jörg-Rüdiger, Santoro, Nicola, ...

A Complete and Efficient Algorithm for the Intersection of a General and a Convex Polyhedron (1993)