Jean-Daniel Boissonnat

From MaRDI portal
Person:203738

Available identifiers

zbMath Open boissonnat.jean-danielMaRDI QIDQ203738

List of research outcomes





PublicationDate of PublicationType
Dimensionality Reduction for k-Distance Applied to Persistent Homology2023-11-02Paper
The Topological Correctness of PL-Approximations of Isomanifolds2023-11-02Paper
Edge Collapse and Persistence of Flag Complexes2023-11-02Paper
The reach of subsets of manifolds2023-09-18Paper
Tracing Isomanifolds in \(\mathbb{R}\) d in Time Polynomial in d using Coxeter–Freudenthal–Kuhn Triangulations2023-04-28Paper
Strong collapse and persistent homology2023-03-09Paper
Local criteria for triangulating general manifolds2023-01-23Paper
Topological data analysis2022-10-07Paper
On the boundary of a union of Rays2022-08-16Paper
The topological correctness of PL approximations of isomanifolds2022-08-05Paper
Computing Persistent Homology of Flag Complexes via Strong Collapses2022-07-18Paper
https://portal.mardi4nfdi.de/entity/Q50757592022-05-11Paper
Dimensionality reduction for \(k\)-distance applied to persistent homology2022-01-10Paper
Local conditions for triangulating submanifolds of Euclidean space2021-08-18Paper
Strong Collapse for Persistence2021-08-04Paper
Triangulating submanifolds: an elementary and quantified version of Whitney's method2021-07-02Paper
Randomized incremental construction of Delaunay triangulations of nice point sets2021-07-02Paper
The Reach, Metric Distortion, Geodesic Convexity and the Variation of Tangent Spaces.2020-08-18Paper
Local criteria for triangulation of manifolds2020-08-18Paper
https://portal.mardi4nfdi.de/entity/Q51112392020-05-26Paper
Tight kernels for covering and hitting: point hyperplane cover and polynomial point hitting set2020-02-12Paper
The reach, metric distortion, geodesic convexity and the variation of tangent spaces2019-09-11Paper
Computing persistent homology with various coefficient fields in a single pass2019-09-11Paper
Anisotropic Triangulations via Discrete Riemannian Voronoi Diagrams2019-09-02Paper
An Efficient Representation for Filtrations of Simplicial Complexes2019-03-28Paper
Geometric and Topological Inference2018-10-25Paper
Anisotropic triangulations via discrete Riemannian Voronoi diagrams2018-08-13Paper
An Efficient Representation for Filtrations of Simplicial Complexes2018-07-16Paper
Delaunay triangulation of manifolds2018-05-18Paper
An obstruction to Delaunay triangulations in Riemannian manifolds2018-02-28Paper
Only distances are required to reconstruct submanifolds2018-02-12Paper
Anisotropic Delaunay Meshes of Surfaces2017-10-20Paper
Incremental construction of the delaunay triangulation and the delaunay graph in medium dimension2017-10-20Paper
Learning smooth objects by probing2017-10-20Paper
Building efficient and compact data structures for simplicial complexes2017-10-10Paper
Building Efficient and Compact Data Structures for Simplicial Complexes2017-10-10Paper
Triangulations in CGAL (extended abstract)2017-09-29Paper
Complexity of the delaunay triangulation of points on surfaces the smooth case2017-09-29Paper
Smooth surface reconstruction via natural neighbour interpolation of distance functions2017-09-29Paper
CGALmesh: a generic framework for Delaunay mesh generation2016-10-24Paper
On the complexity of the representation of simplicial complexes by trees2016-01-28Paper
The compressed annotation matrix: an efficient data structure for computing persistent cohomology2015-11-19Paper
A Probabilistic Approach to Reducing Algebraic Complexity of Delaunay Triangulations2015-11-19Paper
An elementary approach to tangent space variation on Riemannian submanifolds2015-06-21Paper
Anisotropic Delaunay Mesh Generation2015-06-02Paper
DELAUNAY STABILITY VIA PERTURBATIONS2015-01-23Paper
The Simplex Tree: An Efficient Data Structure for General Simplicial Complexes2015-01-19Paper
https://portal.mardi4nfdi.de/entity/Q29346612014-12-18Paper
Computing persistent homology with various coefficient fields in a single pass2014-10-08Paper
The Gudhi Library: Simplicial Complexes and Persistent Homology2014-09-08Paper
The stability of Delaunay triangulations2014-08-11Paper
Stability of Delaunay-type structures for manifolds (extended abstract)2014-08-07Paper
The Simplex Tree: An Efficient Data Structure for General Simplicial Complexes2014-05-14Paper
Manifold reconstruction using tangential Delaunay complexes2014-04-03Paper
Geometric tomography with topological guarantees2014-04-03Paper
Manifold reconstruction using tangential Delaunay complexes2014-03-25Paper
Geometric tomography with topological guarantees2014-01-24Paper
The compressed annotation matrix: an efficient data structure for computing persistent cohomology2013-09-17Paper
The Simplex Tree: An Efficient Data Structure for General Simplicial Complexes2012-09-25Paper
Triangulating smooth submanifolds with light scaffolding2012-01-02Paper
Bregman Voronoi diagrams2010-09-22Paper
Isotopic implicit surface meshing2010-08-15Paper
Stability and computation of medial axes: a state-of-the-art report2009-12-11Paper
Manifold reconstruction in arbitrary dimensions using witness complexes2009-07-06Paper
https://portal.mardi4nfdi.de/entity/Q36199372009-04-14Paper
Locally uniform anisotropic meshing2009-02-12Paper
Manifold reconstruction in arbitrary dimensions using witness complexes2009-02-12Paper
Visualizing bregman voronoi diagrams2009-02-12Paper
https://portal.mardi4nfdi.de/entity/Q36015572009-02-10Paper
Anisotropic diagrams: Labelle Shewchuk approach revisited2008-12-12Paper
Isotopic implicit surface meshing2008-04-16Paper
Meshing of surfaces2007-06-19Paper
Curved Voronoi diagrams2007-06-19Paper
Learning smooth shapes by probing2007-03-15Paper
Algorithms – ESA 20052006-06-27Paper
Voronoi diagrams, triangulations and surfaces2006-04-28Paper
Provably good sampling and meshing of surfaces2005-11-01Paper
COMPUTING LARGEST CIRCLES SEPARATING TWO SETS OF SEGMENTS2005-06-10Paper
A linear bound on the complexity of the Delaunay triangulation of points on polyhedral surfaces2004-12-16Paper
A Polynomial-Time Algorithm for Computing Shortest Paths of Bounded Curvature Amidst Moderate Obstacles2004-09-29Paper
COMPUTING THE DIAMETER OF A POINT SET2004-09-29Paper
https://portal.mardi4nfdi.de/entity/Q47382602004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q44722982004-08-04Paper
https://portal.mardi4nfdi.de/entity/Q44724732004-08-04Paper
https://portal.mardi4nfdi.de/entity/Q44713122004-07-28Paper
Complexity of the Delaunay triangulation of points on polyhedral surfaces2004-07-07Paper
Slicing Minkowski sums for satellite antenna layout.2003-09-24Paper
An algorithm for computing a convex and simple path of bounded curvature in a simple polygon2002-09-25Paper
Natural neighbor coordinates of points on a surface2002-06-26Paper
Triangulations in CGAL2002-06-24Paper
Smooth surface reconstruction via natural neighbour interpolation of distance functions2002-06-24Paper
Circular separability of polygons2002-05-14Paper
An elementary algorithm for reporting intersections of red/blue curve segments2002-03-14Paper
Efficient algorithms for line and curve segment intersection using restricted predicates2001-04-09Paper
Motion Planning of Legged Robots2000-10-18Paper
Robust Plane Sweep for Intersecting Segments2000-03-19Paper
Convex tours of bounded curvature2000-01-17Paper
Shortest plane paths with bounded derivative of the curvature1999-01-01Paper
https://portal.mardi4nfdi.de/entity/Q42172931998-11-08Paper
Voronoi diagrams in higher dimensions under certain polyhedral distance functions1998-06-11Paper
Evaluating signs of determinants using single-precision arithmetic1997-06-30Paper
https://portal.mardi4nfdi.de/entity/Q48485851997-04-23Paper
Shortest paths of bounded curvature in the plane1997-03-25Paper
An algorithm for constructing the convex hull of a set of spheres in dimension \(d\)1996-11-04Paper
https://portal.mardi4nfdi.de/entity/Q48860571996-08-22Paper
On-line construction of the upper envelope of triangles and surface patches in three dimensions1996-07-14Paper
OUTPUT SENSITIVE CONSTRUCTION OF THE DELAUNAY TRIANGULATION OF POINTS LYING IN TWO PLANES1996-06-04Paper
MOTION PLANNING OF LEGGED ROBOTS: THE SPIDER ROBOT PROBLEM1996-02-26Paper
https://portal.mardi4nfdi.de/entity/Q48485901996-01-17Paper
https://portal.mardi4nfdi.de/entity/Q31391201993-12-07Paper
A semidynamic construction of higher-order Voronoi diagrams and its randomized analysis1993-06-29Paper
On the randomized construction of the Delaunay tree1993-05-24Paper
Applications of random sampling to on-line algorithms in computational geometry1992-09-27Paper
Probing a scene of nonconvex polyhedra1992-09-27Paper
COMPUTING THE UNION OF 3-COLORED TRIANGLES1992-06-27Paper
An optimal algorithm for the boundary of a cell in a union of rays - Corrigendum1991-01-01Paper
Representing stereo data with the Delaunay triangulation1990-01-01Paper
Non-convex contour reconstruction1990-01-01Paper
An optimal algorithm for the boundary of a cell in a union of rays1990-01-01Paper
Polygon placement under translation and rotation1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37874921988-01-01Paper

Research outcomes over time

This page was built for person: Jean-Daniel Boissonnat