The following pages link to Jean-Daniel Boissonnat (Q203738):
Displaying 50 items.
- The Simplex Tree: An Efficient Data Structure for General Simplicial Complexes (Q134868) (← links)
- (Q238450) (redirect page) (← links)
- (Q393723) (redirect page) (← links)
- Geometric tomography with topological guarantees (Q393725) (← links)
- (Q487002) (redirect page) (← links)
- (Q588548) (redirect page) (← links)
- Triangulating smooth submanifolds with light scaffolding (Q655155) (← links)
- Evaluating signs of determinants using single-precision arithmetic (Q675307) (← links)
- An algorithm for computing a convex and simple path of bounded curvature in a simple polygon (Q699767) (← links)
- A linear bound on the complexity of the Delaunay triangulation of points on polyhedral surfaces (Q701788) (← links)
- Learning smooth shapes by probing (Q871061) (← links)
- The compressed annotation matrix: an efficient data structure for computing persistent cohomology (Q893322) (← links)
- On the complexity of the representation of simplicial complexes by trees (Q905846) (← links)
- An optimal algorithm for the boundary of a cell in a union of rays (Q911755) (← links)
- Anisotropic diagrams: Labelle Shewchuk approach revisited (Q959807) (← links)
- Applications of random sampling to on-line algorithms in computational geometry (Q1192610) (← links)
- Probing a scene of nonconvex polyhedra (Q1194334) (← links)
- On the randomized construction of the Delaunay tree (Q1210297) (← links)
- Voronoi diagrams in higher dimensions under certain polyhedral distance functions (Q1389168) (← links)
- Slicing Minkowski sums for satellite antenna layout. (Q1401874) (← links)
- Complexity of the Delaunay triangulation of points on polyhedral surfaces (Q1434252) (← links)
- Efficient algorithms for line and curve segment intersection using restricted predicates (Q1567304) (← links)
- Triangulations in CGAL (Q1602941) (← links)
- Smooth surface reconstruction via natural neighbour interpolation of distance functions (Q1602948) (← links)
- Only distances are required to reconstruct submanifolds (Q1693317) (← links)
- An obstruction to Delaunay triangulations in Riemannian manifolds (Q1702353) (← links)
- Delaunay triangulation of manifolds (Q1750387) (← links)
- Shortest paths of bounded curvature in the plane (Q1842753) (← links)
- On-line construction of the upper envelope of triangles and surface patches in three dimensions (Q1917040) (← links)
- An algorithm for constructing the convex hull of a set of spheres in dimension \(d\) (Q1917048) (← links)
- Convex tours of bounded curvature (Q1961381) (← links)
- Randomized incremental construction of Delaunay triangulations of nice point sets (Q2039315) (← links)
- Triangulating submanifolds: an elementary and quantified version of Whitney's method (Q2039324) (← links)
- Local conditions for triangulating submanifolds of Euclidean space (Q2046445) (← links)
- Dimensionality reduction for \(k\)-distance applied to persistent homology (Q2063202) (← links)
- Topological data analysis (Q2080132) (← links)
- The topological correctness of PL approximations of isomanifolds (Q2162117) (← links)
- Tight kernels for covering and hitting: point hyperplane cover and polynomial point hitting set (Q2294690) (← links)
- The reach, metric distortion, geodesic convexity and the variation of tangent spaces (Q2324602) (← links)
- Computing persistent homology with various coefficient fields in a single pass (Q2324603) (← links)
- A semidynamic construction of higher-order Voronoi diagrams and its randomized analysis (Q2366225) (← links)
- Building efficient and compact data structures for simplicial complexes (Q2408925) (← links)
- Manifold reconstruction using tangential Delaunay complexes (Q2441577) (← links)
- Non-convex contour reconstruction (Q2638822) (← links)
- Representing stereo data with the Delaunay triangulation (Q2638828) (← links)
- An optimal algorithm for the boundary of a cell in a union of rays - Corrigendum (Q2639639) (← links)
- Local criteria for triangulating general manifolds (Q2679601) (← links)
- CGALmesh: a generic framework for Delaunay mesh generation (Q2828147) (← links)
- Stability of Delaunay-type structures for manifolds (extended abstract) (Q2874584) (← links)
- The stability of Delaunay triangulations (Q2875645) (← links)
