Triangulation of 3-D Objects. - Jean-Daniel Boissonnat; Olivier D. Faugeras (IJCAI, 1981)

A New Approach to the Problem of Acquiring Randomly Oriented Workpieces Out of a Bin. - Jean-Daniel Boissonnat; F. Germain (IJCAI, 1981)

Stable Matching Between a Hand Structure and an Object Silhouette. - Jean-Daniel Boissonnat (IEEE Trans. Pattern Anal. Mach. Intell., 1982)

Polyhedral approximation of 3-D objects without holes. - Olivier D. Faugeras; Martial Hebert; Philippe Mussi; Jean-Daniel Boissonnat (Comput. Vis. Graph. Image Process., 1984)

Geometric Structures for Three-Dimensional Shape Representation. - Jean-Daniel Boissonnat (ACM Trans. Graph., 1984)

Reconstruction of solids. - Jean-Daniel Boissonnat (SCG, 1985)

The Hierarchical Representation of Objects: The Delaunay Tree. - Jean-Daniel Boissonnat; Monique Teillaud (SCG, 1986)

An Optimal O(n log n) Algorithm for Contour Reconstruction from Rays. - Panagiotis Alevizos; Jean-Daniel Boissonnat; Mariette Yvinec (SCG, 1987)

Simultaneous Containment of Several Polygons. - Francis Avnaim; Jean-Daniel Boissonnat (SCG, 1987)

A practical exact motion planning algorithm for polygonal object amidst polygonal obstacles. - Francis Avnaim; Jean-Daniel Boissonnat; Bernard Faverjon (Geometry and Robotics, 1988)

How the Delaunay Triangulation Can Be used For Representing Stereo Data. - Elisabeth Le Bras-Mehlman; Michel Schmitt; Olivier D. Faugeras; Jean-Daniel Boissonnat (ICCV, 1988)

A geometric approach to inspection. - Francis Avnaim; Jean-Daniel Boissonnat (ICPR, 1988)

A practical exact motion planning algorithm for polygonal objects amidst polygonal obstacles. - Francis Avnaim; Jean-Daniel Boissonnat; Bernard Faverjon (ICRA, 1988)

Scene reconstruction from rays application to stereo data. - Jean-Daniel Boissonnat; Olivier Monga (ICRA, 1988)

Shape reconstruction from planar cross sections. - Jean-Daniel Boissonnat (Comput. Vis. Graph. Image Process., 1988)

Probing a Scene of Non Convex Polyhedra. - Jean-Daniel Boissonnat; Mariette Yvinec (SCG, 1989)

On the order induced by a set of rays: application to the probing of nonconvex polygons. - Panagiotis Alevizos; Jean-Daniel Boissonnat; Mariette Yvinec (ICRA, 1989)

On the Boundary of a Union of Rays. - Panagiotis Alevizos; Jean-Daniel Boissonnat; Franco P. Preparata (STACS, 1989)

Polygon Placement Under Translation and Rotation. - Francis Avnaim; Jean-Daniel Boissonnat (RAIRO Theor. Informatics Appl., 1989)

Representing Stereo Data with the Delaunay Triangulation. - Olivier D. Faugeras; Elisabeth Le Bras-Mehlman; Jean-Daniel Boissonnat (Artif. Intell., 1990)

An Optimal Algorithm for the Boundary of a Cell in a Union of Rays. - Panagiotis Alevizos; Jean-Daniel Boissonnat; Franco P. Preparata (Algorithmica, 1990)

Non Convex Contour Reconstruction. - Panagiotis Alevizos; Jean-Daniel Boissonnat; Mariette Yvinec (J. Symb. Comput., 1990)

An Optimal Algorithm for the Boundary of a Cell in a Union of Rays-Corrigendum. - Panagiotis Alevizos; Jean-Daniel Boissonnat; Franco P. Preparata (Algorithmica, 1991)

Computing the union of 3-colored triangles. - Jean-Daniel Boissonnat; Olivier Devillers; Franco P. Preparata (Int. J. Comput. Geom. Appl., 1991)

Automatic Modelling of Three-Dimensional Objects. - Jean-Daniel Boissonnat (Concise Encyclopedia of Modelling & Simulation, 1992)

Stable Placements for Spider Robots. - Jean-Daniel Boissonnat; Olivier Devillers; LeonBattista Donati; Franco P. Preparata (SCG, 1992)

Motion planning for spider robots. - Jean-Daniel Boissonnat; Olivier Devillers; LeonBattista Donati; Franco P. Preparata (ICRA, 1992)

Some New Research Directions in Robot Motion Planning. - Jean-Daniel Boissonnat (IFIP Congress (1), 1992)

Probing a Scene of Nonconvex Polyhedra. - Jean-Daniel Boissonnat; Mariette Yvinec (Algorithmica, 1992)

Applications of Random Sampling to On-line Algorithms in Computational Geometry. - Jean-Daniel Boissonnat; Olivier Devillers; René Schott; Monique Teillaud; Mariette Yvinec (Discret. Comput. Geom., 1992)

On Characterizing and Computing Three- and Four-Finger Force-Closure Grasps of Polyhedral Objects. - Jean Ponce; Steve Sullivan; Jean-Daniel Boissonnat; Jean-Pierre Merlet (ICRA (2), 1993)

3D Simulation of Delivery. - Jean-Daniel Boissonnat; Bernhard Geiger (IEEE Visualization, 1993)

A Semidynamic Construction of Higher-Order Voronoi Diagrams and Its Randomized Analysis. - Jean-Daniel Boissonnat; Olivier Devillers; Monique Teillaud (Algorithmica, 1993)

On the Randomized Construction of the Delaunay Tree. - Jean-Daniel Boissonnat; Monique Teillaud (Theor. Comput. Sci., 1993)

From Spider Robots to Half Disk Robots. - Jean-Daniel Boissonnat; Olivier Devillers; Sylvain Lazard (ICRA, 1994)

Shortest Path Synthesis for Dubins Non-Holonomic Robot. - Xuân-Nam Bui; Philippe Souères; Jean-Daniel Boissonnat; Jean-Paul Laumond (ICRA, 1994)

Shortest paths of bounded curvature in the plane. - Jean-Daniel Boissonnat; André Cérézo; Juliette Leblond (J. Intell. Robotic Syst., 1994)

Evaluation of a New Method to Compute Signs of Determinants. - Francis Avnaim; Jean-Daniel Boissonnat; Olivier Devillers; Franco P. Preparata; Mariette Yvinec (SCG, 1995)

A Global Motion Planner for a Mobile Robot on a Terrain. - Jean-Daniel Boissonnat; Katrin Dobrindt; Bernhard Geiger; Henri Michel (SCG, 1995)

Circular Separability of Polygon. - Jean-Daniel Boissonnat; Jurek Czyzowicz; Olivier Devillers; Mariette Yvinec (SODA, 1995)

On-line Construction of the Upper Envelope of Triangles and Surface Patches in Three Dimensions. - Jean-Daniel Boissonnat; Katrin Dobrindt (Comput. Geom., 1995)

Motion planning of legged robots: the spider robot problem. - Jean-Daniel Boissonnat; Olivier Devillers; LeonBattista Donati; Franco P. Preparata (Int. J. Comput. Geom. Appl., 1995)

Convex Hulls of Bounded Curvature. - Jean-Daniel Boissonnat; Sylvain Lazard (CCCG, 1996)

A Polynomial-Time Algorithm for Computing a Shortest Path of Bounded Curvature Amidst Moderate Obstacles (Extended Abstract). - Jean-Daniel Boissonnat; Sylvain Lazard (SCG, 1996)

Reconstruction of Geological Structures from Heterogeneous and Sparse Data. - Jean-Daniel Boissonnat; Stéphane Nullans (ACM-GIS, 1996)

An Algorithm for Constructing the Convex Hull of a Set of Spheres in Dimension D. - Jean-Daniel Boissonnat; André Cérézo; Olivier Devillers; Jacqueline Duquesne; Mariette Yvinec (Comput. Geom., 1996)

Output-sensitive construction of the {Delaunay} triangulation of points lying in two planes. - Jean-Daniel Boissonnat; André Cérézo; Olivier Devillers; Monique Teillaud (Int. J. Comput. Geom. Appl., 1996)

Minkowski Operations for Satellite Antenna Layout. - Jean-Daniel Boissonnat; Eelco de Lange; Monique Teillaud (SCG, 1997)

Evaluating Signs of Determinants Using Single-Precision Arithmetic. - Francis Avnaim; Jean-Daniel Boissonnat; Olivier Devillers; Franco P. Preparata; Mariette Yvinec (Algorithmica, 1997)

On Computing Four-Finger Equilibrium and Force-Closure Grasps of Polyhedral Objects. - Jean Ponce; Steve Sullivan; Attawith Sudsang; Jean-Daniel Boissonnat; Jean-Pierre Merlet (Int. J. Robotics Res., 1997)

Algorithmic geometry. - Jean-Daniel Boissonnat; Mariette Yvinec (Cambridge University Press, 1998)

Reconstruction of 3D colored Data. - Stéphane Nullans; Jean-Daniel Boissonnat (Eurographics (Short Presentations), 1998)

Slicing Minkowski sums for satellite antenna layout. - Jean-Daniel Boissonnat; Eelco de Lange; Monique Teillaud (Comput. Aided Des., 1998)

Voronoi Diagrams in Higher Dimensions under Certain Polyhedral Distance Functions. - Jean-Daniel Boissonnat; Micha Sharir; Boaz Tagansky; Mariette Yvinec (Discret. Comput. Geom., 1998)

Programming with CGAL: The Example of Triangulations. - Jean-Daniel Boissonnat; Frédéric Cazals; Frank Da; Olivier Devillers; Sylvain Pion; François Rebufat; Monique Teillaud; Mariette Yvinec (SCG, 1999)

Convex tours of bounded curvature. - Jean-Daniel Boissonnat; Jurek Czyzowicz; Olivier Devillers; Jean-Marc Robert 001; Mariette Yvinec (Comput. Geom., 1999)

Triangulations in CGAL (extended abstract). - Jean-Daniel Boissonnat; Olivier Devillers; Monique Teillaud; Mariette Yvinec (SCG, 2000)

2D-Structure Drawings of Similar Molecules. - Jean-Daniel Boissonnat; Frédéric Cazals; Julia Flötotto (GD, 2000)

Voronoi-Based Systems of Coordinates and Surface Reconstruction. - Jean-Daniel Boissonnat (ISAAC, 2000)

Optimized Port Placement for the Totally Endoscopic Coronary Artery Bypass Grafting using the da Vinci Robotic System. - Ève Coste-Manière; Louaï Adhami; Renaud Severac-Bastide; Adrian Lobontiu; John Kenneth Salisbury Jr.; Jean-Daniel Boissonnat; Nick Swarup; Gary Guthart; Élie Mousseaux; Alain Carpentier (ISER, 2000)

Planning and Simulation of Robotically Assisted Minimal Invasive Surgery. - Louaï Adhami; Ève Coste-Manière; Jean-Daniel Boissonnat (MICCAI, 2000)

Efficient algorithms for line and curve segment intersection using restricted predicates. - Jean-Daniel Boissonnat; Jack Snoeyink (Comput. Geom., 2000)

Computing Largest Circles Separating Two Sets of Segments. - Jean-Daniel Boissonnat; Jurek Czyzowicz; Olivier Devillers; Jorge Urrutia; Mariette Yvinec (Int. J. Comput. Geom. Appl., 2000)

Motion Planning of Legged Robots. - Jean-Daniel Boissonnat; Olivier Devillers; Sylvain Lazard (SIAM J. Comput., 2000)

Robust Plane Sweep for Intersecting Segments. - Jean-Daniel Boissonnat; Franco P. Preparata (SIAM J. Comput., 2000)

Circular Separability of Polygons. - Jean-Daniel Boissonnat; Jurek Czyzowicz; Olivier Devillers; Mariette Yvinec (Algorithmica, 2001)

Coarse-to-fine surface simplification with geometric guarantees. - Jean-Daniel Boissonnat; Frédéric Cazals (Comput. Graph. Forum, 2001)

Natural neighbor coordinates of points on a surface. - Jean-Daniel Boissonnat; Frédéric Cazals (Comput. Geom., 2001)

Conforming Orthogonal Meshes. - Sophie Balaven; Chakib Bennis; Jean-Daniel Boissonnat; Mariette Yvinec (IMR, 2002)

A local coordinate system on a surface. - Jean-Daniel Boissonnat; Julia Flötotto (Symposium on Solid Modeling and Applications, 2002)

An Algorithm for Computing a Convex and Simple Path of Bounded Curvature in a Simple Polygon. - Jean-Daniel Boissonnat; Subir Kumar Ghosh; Telikepalli Kavitha; Sylvain Lazard (Algorithmica, 2002)

Smooth surface reconstruction via natural neighbour interpolation of distance functions. - Jean-Daniel Boissonnat; Frédéric Cazals (Comput. Geom., 2002)

Triangulations in CGAL. - Jean-Daniel Boissonnat; Olivier Devillers; Sylvain Pion; Monique Teillaud; Mariette Yvinec (Comput. Geom., 2002)

An elementary algorithm for reporting intersections of red/blue curve segments. - Jean-Daniel Boissonnat; Antoine Vigneron (Comput. Geom., 2002)

Computing the Diameter of a Point Set. - Grégoire Malandain; Jean-Daniel Boissonnat (Int. J. Comput. Geom. Appl., 2002)

Complexity of the delaunay triangulation of points on surfaces the smooth case. - Dominique Attali; Jean-Daniel Boissonnat; André Lieutier (SCG, 2003)

Provably Good Surface Sampling and Approximation. - Steve Oudot; Jean-Daniel Boissonnat (Symposium on Geometry Processing, 2003)

On the combinatorial complexity of euclidean Voronoi cells and convex hulls of d-dimensional spheres. - Jean-Daniel Boissonnat; Menelaos I. Karavelas (SODA, 2003)

Complexity of the Delaunay Triangulation of Points on Polyhedral Surfaces. - Dominique Attali; Jean-Daniel Boissonnat (Discret. Comput. Geom., 2003)

A Polynomial-Time Algorithm for Computing Shortest Paths of Bounded Curvature AmidstModerate Obstacles. - Jean-Daniel Boissonnat; Sylvain Lazard (Int. J. Comput. Geom. Appl., 2003)

An effective condition for sampling surfaces with guarantees. - Jean-Daniel Boissonnat; Steve Oudot (Symposium on Solid Modeling and Applications, 2004)

A coordinate system associated with points scattered on a surface. - Jean-Daniel Boissonnat; Julia Flötotto (Comput. Aided Des., 2004)

A Linear Bound on the Complexity of the Delaunay Triangulation of Points on Polyhedral Surfaces. - Dominique Attali; Jean-Daniel Boissonnat (Discret. Comput. Geom., 2004)

Special Issue on WAFR 2002. - Kenneth Y. Goldberg; Seth Hutchinson 001; Jean-Daniel Boissonnat; Joel W. Burdick (Int. J. Robotics Res., 2004)

Learning smooth objects by probing. - Jean-Daniel Boissonnat; Leonidas J. Guibas; Steve Oudot (SCG, 2005)

Convex Hull and Voronoi Diagram of Additively Weighted Points. - Jean-Daniel Boissonnat; Christophe Delage (ESA, 2005)

Provably good sampling and meshing of surfaces. - Jean-Daniel Boissonnat; Steve Oudot (Graph. Model., 2005)

From arteriographies to computational flow in saccular aneurisms: the INRIA experience. - Jean-Daniel Boissonnat; Raphaëlle Chaine; Pascal Frey; Grégoire Malandain; Stéphanie Salmon; E. Saltel; Marc Thiriet (Medical Image Anal., 2005)

Provably good sampling and meshing of Lipschitz surfaces. - Jean-Daniel Boissonnat; Steve Oudot (SCG, 2006)

Pupil Configuration for Extended Source Imaging with Optical Interferometry: a Computational Geometry Approach. - Trung Nguyen; Jean-Daniel Boissonnat; Philippe Blanc; Frédéric Falzon; Eric Thomas (ICASSP (2), 2006)

Editorial. - Jean-Daniel Boissonnat; Jack Snoeyink (Comput. Geom., 2006)

Guest Editors' Foreword. - Jean-Daniel Boissonnat; Jack Snoeyink (Discret. Comput. Geom., 2006)

A Disk-Covering Problem with Application in Optical Interferometry. - Trung Nguyen; Jean-Daniel Boissonnat; Frédéric Falzon; Christian Knauer (CCCG, 2007)

Visualizing bregman voronoi diagrams. - Frank Nielsen; Jean-Daniel Boissonnat; Richard Nock (SCG, 2007)

Delaunay Deformable Models: Topology-Adaptive Meshes Based on the Restricted Delaunay Triangulation. - Jean-Philippe Pons; Jean-Daniel Boissonnat (CVPR, 2007)

High-Quality Consistent Meshing of Multi-label Datasets. - Jean-Philippe Pons; Florent Ségonne; Jean-Daniel Boissonnat; Laurent Rineau; Mariette Yvinec; Renaud Keriven (IPMI, 2007)

Shape reconstruction from unorganized cross-sections. - Jean-Daniel Boissonnat; Pooran Memari (Symposium on Geometry Processing, 2007)

A Lagrangian Approach to Dynamic Interfaces through Kinetic Triangulation of the Ambient Space. - Jean-Philippe Pons; Jean-Daniel Boissonnat (Comput. Graph. Forum, 2007)

Learning smooth shapes by probing. - Jean-Daniel Boissonnat; Leonidas J. Guibas; Steve Oudot (Comput. Geom., 2007)

Bregman Voronoi Diagrams: Properties, Algorithms and Applications - Frank Nielsen; Jean-Daniel Boissonnat; Richard Nock (CoRR, 2007)

Skeletal Structures. - Silvia Biasotti; Dominique Attali; Jean-Daniel Boissonnat; Herbert Edelsbrunner; Gershon Elber; Michela Mortara; Gabriella Sanniti di Baja; Michela Spagnuolo; Mirela Tanase; Remco C. Veltkamp (Shape Analysis and Structuring, 2008)

Locally uniform anisotropic meshing. - Jean-Daniel Boissonnat; Camille Wormser; Mariette Yvinec (SCG, 2008)

From Segmented Images to Good Quality Meshes Using Delaunay Refinement. - Jean-Daniel Boissonnat; Jean-Philippe Pons; Mariette Yvinec (ETVC, 2008)

Provably Good 2D Shape Reconstruction from Unorganized Cross-Sections. - Pooran Memari; Jean-Daniel Boissonnat (Comput. Graph. Forum, 2008)

Isotopic Implicit Surface Meshing. - Jean-Daniel Boissonnat; David Cohen-Steiner; Gert Vegter (Discret. Comput. Geom., 2008)

Anisotropic diagrams: Labelle Shewchuk approach revisited. - Jean-Daniel Boissonnat; Camille Wormser; Mariette Yvinec (Theor. Comput. Sci., 2008)

Stability and Computation of Medial Axes - a State-of-the-Art Report. - Dominique Attali; Jean-Daniel Boissonnat; Herbert Edelsbrunner (Mathematical Foundations of Scientific Visualization, Computer Graphics, and Massive Data Exploration, 2009)

Incremental construction of the delaunay triangulation and the delaunay graph in medium dimension. - Jean-Daniel Boissonnat; Olivier Devillers; Samuel Hornus (SCG, 2009)

Mesh Generation from 3D Multi-material Images. - Dobrina Boltcheva; Mariette Yvinec; Jean-Daniel Boissonnat (MICCAI (1), 2009)

Feature preserving Delaunay mesh generation from 3D multi-material images. - Dobrina Boltcheva; Mariette Yvinec; Jean-Daniel Boissonnat (Comput. Graph. Forum, 2009)

Manifold Reconstruction in Arbitrary Dimensions Using Witness Complexes. - Jean-Daniel Boissonnat; Leonidas J. Guibas; Steve Oudot (Discret. Comput. Geom., 2009)

Bregman Voronoi Diagrams. - Jean-Daniel Boissonnat; Frank Nielsen; Richard Nock (Discret. Comput. Geom., 2010)

Triangulating Smooth Submanifolds with Light Scaffolding. - Jean-Daniel Boissonnat; Arijit Ghosh (Math. Comput. Sci., 2010)

Stability of Delaunay-type structures for manifolds: [extended abstract]. - Jean-Daniel Boissonnat; Ramsay Dyer; Arijit Ghosh (SCG, 2012)

Constructing Intrinsic Delaunay Triangulations of Submanifolds - Jean-Daniel Boissonnat; Ramsay Dyer; Arijit Ghosh (CoRR, 2013)

Geometric Tomography with Topological Guarantees. - Omid Amini; Jean-Daniel Boissonnat; Pooran Memari (Discret. Comput. Geom., 2013)

The stability of Delaunay Triangulations. - Jean-Daniel Boissonnat; Ramsay Dyer; Arijit Ghosh (Int. J. Comput. Geom. Appl., 2013)

The Gudhi Library: Simplicial Complexes and Persistent Homology. - Clément Maria; Jean-Daniel Boissonnat; Marc Glisse; Mariette Yvinec (ICMS, 2014)

The Simplex Tree: An Efficient Data Structure for General Simplicial Complexes. - Jean-Daniel Boissonnat; Clément Maria (Algorithmica, 2014)

Manifold Reconstruction Using Tangential Delaunay Complexes. - Jean-Daniel Boissonnat; Arijit Ghosh (Discret. Comput. Geom., 2014)

Delaunay stability via perturbations. - Jean-Daniel Boissonnat; Ramsay Dyer; Arijit Ghosh (Int. J. Comput. Geom. Appl., 2014)

A Probabilistic Approach to Reducing Algebraic Complexity of Delaunay Triangulations. - Jean-Daniel Boissonnat; Ramsay Dyer; Arijit Ghosh (ESA, 2015)

The Compressed Annotation Matrix: An Efficient Data Structure for Computing Persistent Cohomology. - Jean-Daniel Boissonnat; Tamal K. Dey; Clément Maria (Algorithmica, 2015)

A probabilistic approach to reducing the algebraic complexity of computing Delaunay triangulations. - Jean-Daniel Boissonnat; Ramsay Dyer; Arijit Ghosh (CoRR, 2015)

Tangent space variation on submanifolds. - Jean-Daniel Boissonnat; Ramsay Dyer; Arijit Ghosh (CoRR, 2015)

Anisotropic Delaunay Mesh Generation. - Jean-Daniel Boissonnat; Camille Wormser; Mariette Yvinec (SIAM J. Comput., 2015)

Anisotropic Delaunay Meshes of Surfaces. - Jean-Daniel Boissonnat; Kan-Le Shi; Jane Tournois; Mariette Yvinec (ACM Trans. Graph., 2015)

CGALmesh: A Generic Framework for Delaunay Mesh Generation. - Clément Jamin; Pierre Alliez; Mariette Yvinec; Jean-Daniel Boissonnat (ACM Trans. Math. Softw., 2015)

On the complexity of the representation of simplicial complexes by trees. - Jean-Daniel Boissonnat; Dorian Mazauric (Theor. Comput. Sci., 2016)

Kernelization of the Subset General Position Problem in Geometry. - Jean-Daniel Boissonnat; Kunal Dutta; Arijit Ghosh; Sudeshna Kolay (MFCS, 2017)

Building Efficient and Compact Data Structures for Simplicial Complexes. - Jean-Daniel Boissonnat; Karthik C. S. 001; Sébastien Tavenas (Algorithmica, 2017)

Only distances are required to reconstruct submanifolds. - Jean-Daniel Boissonnat; Ramsay Dyer; Arijit Ghosh; Steve Y. Oudot (Comput. Geom., 2017)

Local Criteria for Triangulation of Manifolds. - Jean-Daniel Boissonnat; Ramsay Dyer; Arijit Ghosh; Mathijs Wintraecken (SoCG, 2018)

Strong Collapse for Persistence. - Jean-Daniel Boissonnat; Siddharth Pritam; Divyansh Pareek (ESA, 2018)

Tight Kernels for Covering and Hitting: Point Hyperplane Cover and Polynomial Point Hitting Set. - Jean-Daniel Boissonnat; Kunal Dutta; Arijit Ghosh; Sudeshna Kolay (LATIN, 2018)

An Obstruction to Delaunay Triangulations in Riemannian Manifolds. - Jean-Daniel Boissonnat; Ramsay Dyer; Arijit Ghosh; Nikolay Martynchuk (Discret. Comput. Geom., 2018)

Delaunay Triangulation of Manifolds. - Jean-Daniel Boissonnat; Ramsay Dyer; Arijit Ghosh (Found. Comput. Math., 2018)

An Efficient Representation for Filtrations of Simplicial Complexes. - Jean-Daniel Boissonnat; Karthik C. S. 001 (ACM Trans. Algorithms, 2018)

Computing Persistent Homology of Flag Complexes via Strong Collapses. - Jean-Daniel Boissonnat; Siddharth Pritam (SoCG, 2019)

The reach, metric distortion, geodesic convexity and the variation of tangent spaces. - Jean-Daniel Boissonnat; André Lieutier; Mathijs Wintraecken (J. Appl. Comput. Topol., 2019)

Computing persistent homology with various coefficient fields in a single pass. - Jean-Daniel Boissonnat; Clément Maria (J. Appl. Comput. Topol., 2019)

Anisotropic Triangulations via Discrete Riemannian Voronoi Diagrams. - Jean-Daniel Boissonnat; Mael Rouxel-Labbé; Mathijs H. M. J. Wintraecken (SIAM J. Comput., 2019)

Edge Collapse and Persistence of Flag Complexes. - Jean-Daniel Boissonnat; Siddharth Pritam (SoCG, 2020)

Tracing Isomanifolds in ℝ^d in Time Polynomial in d Using Coxeter-Freudenthal-Kuhn Triangulations. - Jean-Daniel Boissonnat; Siargey Kachanovich; Mathijs Wintraecken (SoCG, 2021)

Randomized Incremental Construction of Delaunay Triangulations of Nice Point Sets. - Jean-Daniel Boissonnat; Olivier Devillers; Kunal Dutta; Marc Glisse (Discret. Comput. Geom., 2021)

Local Conditions for Triangulating Submanifolds of Euclidean Space. - Jean-Daniel Boissonnat; Ramsay Dyer; Arijit Ghosh; André Lieutier; Mathijs Wintraecken (Discret. Comput. Geom., 2021)

Triangulating Submanifolds: An Elementary and Quantified Version of Whitney's Method. - Jean-Daniel Boissonnat; Siargey Kachanovich; Mathijs Wintraecken (Discret. Comput. Geom., 2021)

Dimensionality reduction for k-distance applied to persistent homology. - Shreya Arya; Jean-Daniel Boissonnat; Kunal Dutta; Martin Lotz (J. Appl. Comput. Topol., 2021)

The Topological Correctness of PL Approximations of Isomanifolds. - Jean-Daniel Boissonnat; Mathijs Wintraecken (Found. Comput. Math., 2022)

Dimensionality Reduction for Persistent Homology with Gaussian Kernels. - Jean-Daniel Boissonnat; Kunal Dutta (CoRR, 2023)

Strong Collapse of Random Simplicial Complexes. - Jean-Daniel Boissonnat; Kunal Dutta; Soumik Dutta; Siddharth Pritam (CoRR, 2023)

Local Criteria for Triangulating General Manifolds. - Jean-Daniel Boissonnat; Ramsay Dyer; Arijit Ghosh; Mathijs Wintraecken (Discret. Comput. Geom., 2023)

Tracing Isomanifolds in ( mathbb{R} ) d in Time Polynomial in d using Coxeter-Freudenthal-Kuhn Triangulations. - Jean-Daniel Boissonnat; Siargey Kachanovich; Mathijs Wintraecken (SIAM J. Comput., 2023)

The reach of subsets of manifolds. - Jean-Daniel Boissonnat; Mathijs Wintraecken (J. Appl. Comput. Topol., 2023)

On Edge Collapse of Random Simplicial Complexes. - Jean-Daniel Boissonnat; Kunal Dutta; Soumik Dutta; Siddharth Pritam (SoCG, 2024)

A Euclidean Embedding for Computing Persistent Homology with Gaussian Kernels. - Jean-Daniel Boissonnat; Kunal Dutta (ESA, 2024)