Mariette Yvinec

According to our database1, Mariette Yvinec authored at least 51 papers between 1987 and 2015.

Collaborative distances:



In proceedings 
PhD thesis 




CGALmesh: A Generic Framework for Delaunay Mesh Generation.
ACM Trans. Math. Softw., 2015

Anisotropic Delaunay Meshes of Surfaces.
ACM Trans. Graph., 2015

Anisotropic Delaunay Mesh Generation.
SIAM J. Comput., 2015

A surface reconstruction method for in-detail underwater 3D optical mapping.
I. J. Robotics Res., 2015

The Gudhi Library: Simplicial Complexes and Persistent Homology.
Proceedings of the Mathematical Software - ICMS 2014, 2014

Splat-based surface reconstruction from defect-laden point sets.
Graphical Models, 2013

Meshing volumes with curved boundaries.
Eng. Comput. (Lond.), 2010

Feature Preserving Mesh Generation from 3D Point Clouds.
Comput. Graph. Forum, 2010

Feature preserving Delaunay mesh generation from 3D multi-material images.
Comput. Graph. Forum, 2009

Mesh Generation from 3D Multi-material Images.
Proceedings of the Medical Image Computing and Computer-Assisted Intervention, 2009

Cardiac Motion Extraction from Images by Filtering Estimation Based on a Biomechanical Model.
Proceedings of the Functional Imaging and Modeling of the Heart, 2009

High resolution surface reconstruction from overlapping multiple-views.
Proceedings of the 25th ACM Symposium on Computational Geometry, 2009

From Segmented Images to Good Quality Meshes Using Delaunay Refinement.
Proceedings of the Emerging Trends in Visual Computing, 2008

Locally uniform anisotropic meshing.
Proceedings of the 24th ACM Symposium on Computational Geometry, 2008

A generic software design for Delaunay refinement meshing.
Comput. Geom., 2007

High-Quality Consistent Meshing of Multi-label Datasets.
Proceedings of the Information Processing in Medical Imaging, 2007

Meshing 3D Domains Bounded by Piecewise Smooth Surfaces*.
Proceedings of the 16th International Meshing Roundtable, 2007

Reconstruction with Voronoi centered radial basis functions.
Proceedings of the Fourth Eurographics Symposium on Geometry Processing, Cagliari, 2006

Variational tetrahedral meshing.
Proceedings of the 32. International Conference on Computer Graphics and Interactive Techniques, 2005

Meshing Volumes Bounded by Smooth Surfaces.
Proceedings of the 14th International Meshing Roundtable, 2005

Anisotropic Diagrams: Labelle Shewchuk approach revisited.
Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

The Voronoi Diagram of Planar Convex Objects.
Proceedings of the Algorithms, 2003

Triangulations in CGAL.
Comput. Geom., 2002

Conforming Orthogonal Meshes.
Proceedings of the 11th International Meshing Roundtable, 2002

Dynamic Additively Weighted Voronoi Diagrams in 2D.
Proceedings of the Algorithms, 2002

Conforming Delaunay triangulations in 3D.
Proceedings of the 18th Annual Symposium on Computational Geometry, Barcelona, 2002

Circular Separability of Polygons.
Algorithmica, 2001

Triangulations in CGAL (extended abstract).
Proceedings of the Sixteenth Annual Symposium on Computational Geometry, 2000

Convex tours of bounded curvature.
Comput. Geom., 1999

Programming with CGAL: The Example of Triangulations.
Proceedings of the Fifteenth Annual Symposium on Computational Geometry, 1999

Output-Sensitive Convex Hull Algorithms of Planar Convex Objects.
Int. J. Comput. Geometry Appl., 1998

Algorithmic geometry.
Cambridge University Press, ISBN: 978-0-521-56529-5, 1998

Evaluating Signs of Determinants Using Single-Precision Arithmetic.
Algorithmica, 1997

Efficient Exact Evaluation of Signs of Determinants.
Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

An Algorithm for Constructing the Convex Hull of a Set of Spheres in Dimension D.
Comput. Geom., 1996

Computing Largest Circles Separating Two Sets of Segments.
Proceedings of the 8th Canadian Conference on Computational Geometry, 1996

Circular Separability of Polygon.
Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995

Voronoi Diagrams in Higher Dimensions under Certain Polyhedral Distance Functions.
Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995

Evaluation of a New Method to Compute Signs of Determinants.
Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995

Convex Tours on Bounded Curvature.
Proceedings of the Algorithms, 1994

A Complete and Efficient Algorithm for the Intersection of a General and a Convex Polyhedron.
Proceedings of the Algorithms and Data Structures, Third Workshop, 1993

Remembering Conflicts in History Yields Dynamic Algorithms.
Proceedings of the Algorithms and Computation, 4th International Symposium, 1993

Applications of Random Sampling to On-line Algorithms in Computational Geometry.
Discrete & Computational Geometry, 1992

Probing a Scene of Nonconvex Polyhedra.
Algorithmica, 1992

Computation of the axial view of a set of isothetic parallelepipeds.
ACM Trans. Graph., 1990

Non Convex Contour Reconstruction.
J. Symb. Comput., 1990

Output-Sensitive Generation of the Perspective View of Isothetic Parallelepipeds.
Proceedings of the SWAT 90, 1990

On the order induced by a set of rays: application to the probing of nonconvex polygons.
Proceedings of the 1989 IEEE International Conference on Robotics and Automation, 1989

Probing a Scene of Non Convex Polyhedra.
Proceedings of the Fifth Annual Symposium on Computational Geometry, 1989

Triangulation in 2d and 3d space.
Proceedings of the Geometry and Robotics, 1988

An Optimal O(n log n) Algorithm for Contour Reconstruction from Rays.
Proceedings of the Third Annual Symposium on Computational Geometry, 1987