Jean-Daniel Boissonnat

According to our database1, Jean-Daniel Boissonnat authored at least 176 papers between 1981 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2018
Delaunay Triangulation of Manifolds.
Foundations of Computational Mathematics, 2018

An Obstruction to Delaunay Triangulations in Riemannian Manifolds.
Discrete & Computational Geometry, 2018

Local criteria for triangulation of manifolds.
CoRR, 2018

Tight Kernels for Covering and Hitting: Point Hyperplane Cover and Polynomial Point Hitting Set.
Proceedings of the LATIN 2018: Theoretical Informatics, 2018

Strong Collapse for Persistence.
Proceedings of the 26th Annual European Symposium on Algorithms, 2018

The Reach, Metric Distortion, Geodesic Convexity and the Variation of Tangent Spaces.
Proceedings of the 34th International Symposium on Computational Geometry, 2018

Local Criteria for Triangulation of Manifolds.
Proceedings of the 34th International Symposium on Computational Geometry, 2018

2017
Anisotropic triangulations via discrete Riemannian Voronoi diagrams.
CoRR, 2017

Only distances are required to reconstruct submanifolds.
Comput. Geom., 2017

Building Efficient and Compact Data Structures for Simplicial Complexes.
Algorithmica, 2017

An Efficient Representation for Filtrations of Simplicial Complexes.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Kernelization of the Subset General Position Problem in Geometry.
Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

Anisotropic Triangulations via Discrete Riemannian Voronoi Diagrams.
Proceedings of the 33rd International Symposium on Computational Geometry, 2017

2016
On the complexity of the representation of simplicial complexes by trees.
Theor. Comput. Sci., 2016

An Efficient Representation for Filtrations of Simplicial Complexes.
CoRR, 2016

An obstruction to Delaunay triangulations in Riemannian manifolds.
CoRR, 2016

2015
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

Building Efficient and Compact Data Structures for Simplicial Complexes.
CoRR, 2015

Tangent space variation on submanifolds.
CoRR, 2015

A probabilistic approach to reducing the algebraic complexity of computing Delaunay triangulations.
CoRR, 2015

The Compressed Annotation Matrix: An Efficient Data Structure for Computing Persistent Cohomology.
Algorithmica, 2015

A Probabilistic Approach to Reducing Algebraic Complexity of Delaunay Triangulations.
Proceedings of the Algorithms - ESA 2015, 2015

Building Efficient and Compact Data Structures for Simplicial Complexes.
Proceedings of the 31st International Symposium on Computational Geometry, 2015

2014
Delaunay stability via perturbations.
Int. J. Comput. Geometry Appl., 2014

Manifold Reconstruction Using Tangential Delaunay Complexes.
Discrete & Computational Geometry, 2014

Only distances are required to reconstruct submanifolds.
CoRR, 2014

The Simplex Tree: An Efficient Data Structure for General Simplicial Complexes.
Algorithmica, 2014

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

Computing Persistent Homology with Various Coefficient Fields in a Single Pass.
Proceedings of the Algorithms - ESA 2014, 2014

2013
The stability of Delaunay Triangulations.
Int. J. Comput. Geometry Appl., 2013

Geometric Tomography with Topological Guarantees.
Discrete & Computational Geometry, 2013

The Compressed Annotation Matrix: an Efficient Data Structure for Computing Persistent Cohomology
CoRR, 2013

The Stability of Delaunay Triangulations
CoRR, 2013

Constructing Intrinsic Delaunay Triangulations of Submanifolds
CoRR, 2013

Delaunay triangulation of manifolds.
CoRR, 2013

Delaunay stability via perturbations.
CoRR, 2013

The Compressed Annotation Matrix: An Efficient Data Structure for Computing Persistent Cohomology.
Proceedings of the Algorithms - ESA 2013, 2013

2012
The Simplex Tree: An Efficient Data Structure for General Simplicial Complexes.
Proceedings of the Algorithms - ESA 2012, 2012

Stability of Delaunay-type structures for manifolds: [extended abstract].
Proceedings of the Symposuim on Computational Geometry 2012, 2012

2010
Triangulating Smooth Submanifolds with Light Scaffolding.
Mathematics in Computer Science, 2010

Bregman Voronoi Diagrams.
Discrete & Computational Geometry, 2010

Geometric Tomography With Topological Guarantees
CoRR, 2010

Manifold reconstruction using tangential Delaunay complexes.
Proceedings of the 26th ACM Symposium on Computational Geometry, 2010

Geometric tomography with topological guarantees.
Proceedings of the 26th ACM Symposium on Computational Geometry, 2010

2009
Manifold Reconstruction in Arbitrary Dimensions Using Witness Complexes.
Discrete & Computational Geometry, 2009

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

Incremental construction of the delaunay triangulation and the delaunay graph in medium dimension.
Proceedings of the 25th ACM Symposium on Computational Geometry, 2009

2008
Anisotropic diagrams: Labelle Shewchuk approach revisited.
Theor. Comput. Sci., 2008

Isotopic Implicit Surface Meshing.
Discrete & Computational Geometry, 2008

Provably Good 2D Shape Reconstruction from Unorganized Cross-Sections.
Comput. Graph. Forum, 2008

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


2007
Bregman Voronoi Diagrams: Properties, Algorithms and Applications
CoRR, 2007

Learning smooth shapes by probing.
Comput. Geom., 2007

A Lagrangian Approach to Dynamic Interfaces through Kinetic Triangulation of the Ambient Space.
Comput. Graph. Forum, 2007

On Bregman Voronoi diagrams.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Shape reconstruction from unorganized cross-sections.
Proceedings of the Fifth Eurographics Symposium on Geometry Processing, Barcelona, 2007

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

Delaunay Deformable Models: Topology-Adaptive Meshes Based on the Restricted Delaunay Triangulation.
Proceedings of the 2007 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR 2007), 2007

Visualizing bregman voronoi diagrams.
Proceedings of the 23rd ACM Symposium on Computational Geometry, Gyeongju, 2007

Manifold reconstruction in arbitrary dimensions using witness complexes.
Proceedings of the 23rd ACM Symposium on Computational Geometry, Gyeongju, 2007

A Disk-Covering Problem with Application in Optical Interferometry.
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

2006
Guest Editors' Foreword.
Discrete & Computational Geometry, 2006

A disk-covering problem with application in optical interferometry
CoRR, 2006

Editorial.
Comput. Geom., 2006

Pupil Configuration for Extended Source Imaging with Optical Interferometry: a Computational Geometry Approach.
Proceedings of the 2006 IEEE International Conference on Acoustics Speech and Signal Processing, 2006

Provably good sampling and meshing of Lipschitz surfaces.
Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006

2005
From arteriographies to computational flow in saccular aneurisms: the INRIA experience.
Medical Image Analysis, 2005

Provably good sampling and meshing of surfaces.
Graphical Models, 2005

Convex Hull and Voronoi Diagram of Additively Weighted Points.
Proceedings of the Algorithms, 2005

Learning smooth objects by probing.
Proceedings of the 21st ACM Symposium on Computational Geometry, 2005

Learning smooth objects by probing.
Proceedings of the 21st ACM Symposium on Computational Geometry, 2005

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

2004
Special Issue on WAFR 2002.
I. J. Robotics Res., 2004

A Linear Bound on the Complexity of the Delaunay Triangulation of Points on Polyhedral Surfaces.
Discrete & Computational Geometry, 2004

A coordinate system associated with points scattered on a surface.
Computer-Aided Design, 2004

Isotopic implicit surface meshing.
Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004

2003
A Polynomial-Time Algorithm for Computing Shortest Paths of Bounded Curvature AmidstModerate Obstacles.
Int. J. Comput. Geometry Appl., 2003

Complexity of the Delaunay Triangulation of Points on Polyhedral Surfaces.
Discrete & Computational Geometry, 2003

On the combinatorial complexity of euclidean Voronoi cells and convex hulls of d-dimensional spheres.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

Provably Good Surface Sampling and Approximation.
Proceedings of the First Eurographics Symposium on Geometry Processing, 2003

Complexity of the delaunay triangulation of points on surfaces the smooth case.
Proceedings of the 19th ACM Symposium on Computational Geometry, 2003

2002
Computing the Diameter of a Point Set.
Int. J. Comput. Geometry Appl., 2002

An elementary algorithm for reporting intersections of red/blue curve segments.
Comput. Geom., 2002

Triangulations in CGAL.
Comput. Geom., 2002

Smooth surface reconstruction via natural neighbour interpolation of distance functions.
Comput. Geom., 2002

An Algorithm for Computing a Convex and Simple Path of Bounded Curvature in a Simple Polygon.
Algorithmica, 2002

A local coordinate system on a surface.
Proceedings of the Seventh ACM Symposium on Solid Modeling and Applications, 2002

A linear bound on the complexity of the delaunay triangulation of points on polyhedral surfaces.
Proceedings of the Seventh ACM Symposium on Solid Modeling and Applications, 2002

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

Computing the Diameter of a Point Set.
Proceedings of the Discrete Geometry for Computer Imagery, 10th International Conference, 2002

2001
Natural neighbor coordinates of points on a surface.
Comput. Geom., 2001

Coarse-to-fine surface simplification with geometric guarantees.
Comput. Graph. Forum, 2001

Circular Separability of Polygons.
Algorithmica, 2001

2000
Robust Plane Sweep for Intersecting Segments.
SIAM J. Comput., 2000

Motion Planning of Legged Robots.
SIAM J. Comput., 2000

Computing Largest Circles Separating Two Sets of Segments.
Int. J. Comput. Geometry Appl., 2000

Efficient algorithms for line and curve segment intersection using restricted predicates.
Comput. Geom., 2000

Planning and Simulation of Robotically Assisted Minimal Invasive Surgery.
Proceedings of the Medical Image Computing and Computer-Assisted Intervention, 2000

Optimized Port Placement for the Totally Endoscopic Coronary Artery Bypass Grafting using the da Vinci Robotic System.
Proceedings of the Experimental Robotics VII [ISER 2000, 2000

Voronoi-Based Systems of Coordinates and Surface Reconstruction.
Proceedings of the Algorithms and Computation, 11th International Conference, 2000

2D-Structure Drawings of Similar Molecules.
Proceedings of the Graph Drawing, 8th International Symposium, 2000

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

Smooth surface reconstruction via natural neighbour interpolation of distance functions.
Proceedings of the Sixteenth Annual Symposium on Computational Geometry, 2000

An Elementary Algorithm for Reporting Intersections of Red/Blue Curve Segments.
Proceedings of the 12th Canadian Conference on Computational Geometry, 2000

1999
Circular Separability of Polygons
CoRR, 1999

Motion Planning of Legged Robots
CoRR, 1999

Computing largest circles separating two sets of segments
CoRR, 1999

Convex Tours of Bounded Curvature
CoRR, 1999

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

Efficient Algorithms for Line and Curve Segment Intersection Using Restricted Predicates.
Proceedings of the Fifteenth Annual Symposium on Computational Geometry, 1999

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

1998
Voronoi Diagrams in Higher Dimensions under Certain Polyhedral Distance Functions.
Discrete & Computational Geometry, 1998

Slicing Minkowski sums for satellite antenna layout.
Computer-Aided Design, 1998

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

1997
On Computing Four-Finger Equilibrium and Force-Closure Grasps of Polyhedral Objects.
I. J. Robotics Res., 1997

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

Minkowski Operations for Satellite Antenna Layout.
Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

1996
Output-sensitive construction of the {Delaunay} triangulation of points lying in two planes.
Int. J. Comput. Geometry Appl., 1996

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

Reconstruction of Geological Structures from Heterogeneous and Sparse Data.
Proceedings of the GIS '96, 1996

A Polynomial-Time Algorithm for Computing a Shortest Path of Bounded Curvature Amidst Moderate Obstacles (Extended Abstract).
Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996

Convex Hulls of Bounded Curvature.
Proceedings of the 8th Canadian Conference on Computational Geometry, 1996

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

1995
Motion planning of legged robots: the spider robot problem.
Int. J. Comput. Geometry Appl., 1995

On-line Construction of the Upper Envelope of Triangles and Surface Patches in Three Dimensions.
Comput. Geom., 1995

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

A Global Motion Planner for a Mobile Robot on a Terrain.
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

1994
Shortest paths of bounded curvature in the plane.
Journal of Intelligent and Robotic Systems, 1994

Shortest Path Synthesis for Dubins Non-Holonomic Robot.
Proceedings of the 1994 International Conference on Robotics and Automation, 1994

From Spider Robots to Half Disk Robots.
Proceedings of the 1994 International Conference on Robotics and Automation, 1994

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

1993
On the Randomized Construction of the Delaunay Tree.
Theor. Comput. Sci., 1993

A Semidynamic Construction of Higher-Order Voronoi Diagrams and Its Randomized Analysis.
Algorithmica, 1993

3D Simulation of Delivery.
Proceedings of the Proceedings IEEE Visualization '93, 1993

On Characterizing and Computing Three- and Four-Finger Force-Closure Grasps of Polyhedral Objects.
Proceedings of the 1993 IEEE International Conference on Robotics and Automation, 1993

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

Probing a Scene of Nonconvex Polyhedra.
Algorithmica, 1992

Some New Research Directions in Robot Motion Planning.
Proceedings of the Algorithms, Software, Architecture, 1992

Motion planning for spider robots.
Proceedings of the 1992 IEEE International Conference on Robotics and Automation, 1992

Shortest paths of bounded curvature in the plane.
Proceedings of the 1992 IEEE International Conference on Robotics and Automation, 1992

Stable Placements for Spider Robots.
Proceedings of the Eighth Annual Symposium on Computational Geometry, 1992

1991
Computing the union of 3-colored triangles.
Int. J. Comput. Geometry Appl., 1991

An Optimal Algorithm for the Boundary of a Cell in a Union of Rays-Corrigendum.
Algorithmica, 1991

Shortest paths of Bounded Curvature in the Plane.
Proceedings of the Geometric Reasoning for Perception and Action, Workshop, 1991

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

An Optimal Algorithm for the Boundary of a Cell in a Union of Rays.
Algorithmica, 1990

Representing Stereo Data with the Delaunay Triangulation.
Artif. Intell., 1990

1989
Polygon Placement Under Translation and Rotation.
ITA, 1989

On the Boundary of a Union of Rays.
Proceedings of the STACS 89, 1989

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

1988
Shape reconstruction from planar cross sections.
Computer Vision, Graphics, and Image Processing, 1988

Polygon Placement Under Translation and Rotation.
Proceedings of the STACS 88, 1988

Scene reconstruction from rays application to stereo data.
Proceedings of the 1988 IEEE International Conference on Robotics and Automation, 1988

Representing stereo data with the Delaunay triangulation.
Proceedings of the 1988 IEEE International Conference on Robotics and Automation, 1988

A practical exact motion planning algorithm for polygonal objects amidst polygonal obstacles.
Proceedings of the 1988 IEEE International Conference on Robotics and Automation, 1988

A geometric approach to inspection.
Proceedings of the 9th International Conference on Pattern Recognition, 1988

How the Delaunay Triangulation Can Be used For Representing Stereo Data.
Proceedings of the Second International Conference on Computer Vision, 1988

A practical exact motion planning algorithm for polygonal object amidst polygonal obstacles.
Proceedings of the Geometry and Robotics, 1988

An optimal algorithm for the boundary of a cell in a union of rays.
Proceedings of the Geometry and Robotics, 1988

1987
Simultaneous Containment of Several Polygons.
Proceedings of the Third Annual Symposium on Computational Geometry, 1987

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

1986
The Hierarchical Representation of Objects: The Delaunay Tree.
Proceedings of the Second Annual ACM SIGACT/SIGGRAPH Symposium on Computational Geometry, 1986

1985
Reconstruction of solids.
Proceedings of the First Annual Symposium on Computational Geometry, 1985

1984
Geometric Structures for Three-Dimensional Shape Representation.
ACM Trans. Graph., 1984

Polyhedral approximation of 3-D objects without holes.
Computer Vision, Graphics, and Image Processing, 1984

1982
Stable Matching Between a Hand Structure and an Object Silhouette.
IEEE Trans. Pattern Anal. Mach. Intell., 1982

1981
A New Approach to the Problem of Acquiring Randomly Oriented Workpieces Out of a Bin.
Proceedings of the 7th International Joint Conference on Artificial Intelligence, 1981

Triangulation of 3-D Objects.
Proceedings of the 7th International Joint Conference on Artificial Intelligence, 1981


  Loading...