| Publication | Date of Publication | Type |
|---|
A complete and efficient algorithm for the intersection of a general and a convex polyhedron
Lecture Notes in Computer Science | 2023-01-18 | Paper |
Output-sensitive generation of the perspective view of isothetic parallelepipeds
SWAT 90 | 2022-12-09 | Paper |
Conforming Delaunay triangulations in 3D
Proceedings of the eighteenth annual symposium on Computational geometry | 2018-11-23 | Paper |
| Geometric and topological inference | 2018-10-25 | Paper |
Anisotropic Delaunay meshes of surfaces
ACM Transactions on Graphics | 2017-10-20 | Paper |
Triangulations in CGAL (extended abstract)
Proceedings of the sixteenth annual symposium on Computational geometry | 2017-09-29 | Paper |
CGALmesh: a generic framework for Delaunay mesh generation
ACM Transactions on Mathematical Software | 2016-10-24 | Paper |
Monte Carlo methods for linear and non-linear Poisson-Boltzmann equation
ESAIM: Proceedings and Surveys | 2016-02-10 | Paper |
Anisotropic Delaunay mesh generation
SIAM Journal on Computing | 2015-06-02 | Paper |
The Gudhi library: simplicial complexes and persistent homology
Mathematical Software – ICMS 2014 | 2014-09-08 | Paper |
The Voronoi diagram of planar convex objects
Lecture Notes in Computer Science | 2010-03-03 | Paper |
Locally uniform anisotropic meshing
Proceedings of the twenty-fourth annual symposium on Computational geometry | 2009-02-12 | Paper |
Anisotropic diagrams: Labelle Shewchuk approach revisited
Theoretical Computer Science | 2008-12-12 | Paper |
| Meshing 3D domains bounded by piecewise smooth surfaces | 2008-02-22 | Paper |
A generic software design for Delaunay refinement meshing
Computational Geometry | 2007-07-04 | Paper |
| Curved Voronoi diagrams | 2007-06-19 | Paper |
COMPUTING LARGEST CIRCLES SEPARATING TWO SETS OF SEGMENTS
International Journal of Computational Geometry & Applications | 2005-06-10 | Paper |
Conforming Delaunay triangulations in 3D
Computational Geometry | 2004-08-06 | Paper |
| scientific article; zbMATH DE number 1947424 (Why is no real title available?) | 2003-07-08 | Paper |
Triangulations in CGAL
Computational Geometry | 2002-06-24 | Paper |
Circular separability of polygons
Algorithmica | 2002-05-14 | Paper |
An Output-Sensitive Convex Hull Algorithm for Planar Objects
International Journal of Computational Geometry & Applications | 2000-11-07 | Paper |
Efficient exact evaluation of signs of determinants
Algorithmica | 2000-06-22 | Paper |
Convex tours of bounded curvature
Computational Geometry | 2000-01-17 | Paper |
| scientific article; zbMATH DE number 1220053 (Why is no real title available?) | 1998-11-08 | Paper |
Voronoi diagrams in higher dimensions under certain polyhedral distance functions
Discrete & Computational Geometry | 1998-06-11 | Paper |
Evaluating signs of determinants using single-precision arithmetic
Algorithmica | 1997-06-30 | Paper |
An algorithm for constructing the convex hull of a set of spheres in dimension \(d\)
Computational Geometry | 1996-11-04 | Paper |
| scientific article; zbMATH DE number 910883 (Why is no real title available?) | 1996-08-22 | Paper |
Applications of random sampling to on-line algorithms in computational geometry
Discrete & Computational Geometry | 1992-09-27 | Paper |
Probing a scene of nonconvex polyhedra
Algorithmica | 1992-09-27 | Paper |
Output-sensitive generation of the perspective view of isothetic parallelepipeds
Algorithmica | 1992-09-27 | Paper |
Computation of the axial view of a set of isothetic parallelepipeds
ACM Transactions on Graphics | 1990-01-01 | Paper |
Non-convex contour reconstruction
Journal of Symbolic Computation | 1990-01-01 | Paper |
