HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation


...
inria-00099509v1  Journal articles
Jean-Daniel BoissonnatSylvain Lazard. A polynomial-time algorithm for computing shortest paths of bounded curvature amidst moderate obstacles
International Journal of Computational Geometry and Applications, World Scientific Publishing, 2003, 13 (3), pp.189-229. ⟨10.1142/S0218195903001128⟩
...
inria-00442806v1  Conference papers
Jean-Daniel BoissonnatSylvain Lazard. A polynomial-time algorithm for computing shortest paths of bounded curvature amidst moderate obstacles
Symposium on Computational Geometry (SoCG'96), 1996, Philadelphia, United States. pp.242-251, ⟨10.1145/237218.237393⟩
...
hal-01883836v1  Journal articles
Jean-Daniel BoissonnatC. Karthik. An Efficient Representation for Filtrations of Simplicial Complexes
ACM Transactions on Algorithms, Association for Computing Machinery, 2018, 14
...
hal-01416683v1  Conference papers
Jean-Daniel BoissonnatKarthik C. Srikanta. An Efficient Representation for Filtrations of Simplicial Complexes
Symposium on Discrete Algorithms SODA 2017, Jan 2017, Barcelona, France
hal-01180166v1  Conference papers
Jean-Daniel BoissonnatOlivier DevillersMonique Teillaud. An on-line construction of higher-order Voronoi diagrams and its randomized analysis
Canadian Conference on Computational Geometry, 1990, Ottawa, Canada. pp.278-281
...
inria-00615486v2  Reports
Jean-Daniel BoissonnatCamille WormserMariette Yvinec. Anisotropic Delaunay Mesh Generation
[Research Report] RR-7712, Inria Sophia Antipolis; INRIA. 2014, pp.50
...
hal-01251628v2  Journal articles
Jean-Daniel BoissonnatCamille WormserMariette Yvinec. Anisotropic Delaunay Mesh Generation
SIAM Journal on Computing, Society for Industrial and Applied Mathematics, 2015, 44 (2), pp.467-512. ⟨10.1137/140955446⟩
...
hal-01146307v3  Journal articles
Jean-Daniel BoissonnatKan-Le ShiJane TournoisMariette Yvinec. Anisotropic Delaunay Meshes of Surfaces
ACM Transactions on Graphics, Association for Computing Machinery, 2015, 34 (2), pp.10. ⟨10.1145/2721895⟩
...
hal-02419460v1  Journal articles
Jean-Daniel BoissonnatMaël Rouxel-LabbéMathijs Wintraecken. Anisotropic triangulations via discrete Riemannian Voronoi diagrams
SIAM Journal on Computing, Society for Industrial and Applied Mathematics, 2019
...
hal-00488441v1  Journal articles
Jean-Daniel BoissonnatFrank NielsenRichard Nock. Bregman Voronoi diagrams
Discrete and Computational Geometry, Springer Verlag, 2010, pp.200
...
hal-01145407v1  Conference papers
Jean-Daniel BoissonnatC. S. KarthikSébastien Tavenas. Building Efficient and Compact Data Structures for Simplicial Complexes
International Symposium on Computational Geometry 2015, Jun 2015, Eindhoven, Netherlands. ⟨10.4230/LIPIcs.SOCG.2015.642⟩
...
hal-01071759v1  Journal articles
Clément JaminPierre AlliezMariette YvinecJean-Daniel Boissonnat. CGALmesh: a Generic Framework for Delaunay Mesh Generation
ACM Transactions on Mathematical Software, Association for Computing Machinery, 2015, 41 (4), pp.24. ⟨10.1145/2699463⟩
hal-01179468v1  Conference papers
Jean-Daniel BoissonnatJurek CzyzowiczOlivier DevillersMariette Yvinec. Circular separability of polygon
Proceedings of the 6th ACM-SIAM Symposium on Discrete Algorithms, 1995, ~, United States. pp.273-281
hal-01180152v1  Conference papers
Jean-Daniel BoissonnatOlivier DevillersJacqueline Duquesne. Computing Connolly Surfaces
IFIP Conference on Algorithms and efficient computation, 1992, ?, France
...
inria-00338701v1  Journal articles
Jean-Daniel BoissonnatJurek CzyzowiczOlivier DevillersJorge UrrutiaMariette Yvinec. Computing Largest Circles Separating Two Sets of Segments
International Journal of Computational Geometry and Applications, World Scientific Publishing, 2000, 10, pp.41--54. ⟨10.1142/S0218195900000036⟩