Sylvain Lazard

Présentation

==

My Homepage

PhD students

Léo Valque

,

3D Snap Rounding

, 2024

George Krait

,

Isolating the Singularities of the Plane Projection of Generic Space Curves and Applications in Robotics

, 2021

Yacine Bouzidi

,

Solving bivariate algebraic systems and topology of plane curves

, 2014

Luis Peñaranda

,

Non-linear computational geometry for planar algebraic curves

, 2010

Maria Pentcheva,

Conversion CSG-BRep de scènes définies par des quadriques

, 2010

Linqiao Zhang,

On the three-dimensional visibility skeleton: implementation and analysis

, 2009

Marc Glisse

,

Combinatoire des droites et segments pour la visibilité 3D

, 2007

Geoffroy Lauvaux,

La réalisation d'œuvres d'art par prototypage rapide avec le procédé de Stratoconception

®, 2005

Xavier Goaoc

,

Structures de visibilité globale : taille, calcul et dégénérescences

, 2004

Laurent Dupont

,

Paramétrage quasi-optimal de l'intersection de deux quadriques : théorie, algorithmes et implantation

, 2004

Publications

Thèse (1)

Planification de trajectoires de robots mobiles non-holonomes et de robots à pattes Sylvain Lazard Informatique [cs]. Université Pierre et Marie Curie - Paris VI, 1996. Français. ⟨NNT : ⟩ Thèse tel-00442770v1

HDR (1)

Problèmes de Géométrie Algorithmique sur les Droites et les Quadriques en Trois Dimensions Sylvain Lazard Génie logiciel [cs.SE]. Université Nancy II, 2007 HDR tel-00189033v1

Article dans une revue (44)

Resolving self‐intersections in 3D meshes while preserving floating‐point coordinates Léo Valque,Sylvain Lazard Computer Graphics Forum, 2025, 44 (5), pp.e70197. ⟨10.1111/cgf.70197⟩ Article dans une revue hal-05242294v1
Certified numerical algorithm for isolating the singularities of the plane projection of generic smooth space curves George Krait,Sylvain Lazard,Guillaume Moroz,Marc Pouget Journal of Computational and Applied Mathematics, 2021, 394, pp.113553. ⟨10.1016/j.cam.2021.113553⟩ Article dans une revue hal-03161393v1
Rounding meshes in 3D Olivier Devillers,Sylvain Lazard,William Lenhart Discrete and Computational Geometry, 2020, 64 (1), pp.32--67. ⟨10.1007/s00454-020-00202-2⟩ Article dans une revue hal-02549290v1
Variable-width contouring for additive manufacturing Samuel Hornus,Tim Kuipers,Olivier Devillers,Monique Teillaud,Jonàs Martínezet al. ACM Transactions on Graphics, 2020, 39 (4 (Proc. SIGGRAPH)), ⟨10.1145/3386569.3392448⟩ Article dans une revue hal-02568677v2
On the Edge-length Ratio of Outerplanar Graphs Sylvain Lazard,William Lenhart,Giuseppe Liotta Theoretical Computer Science, 2019, 770, pp.88--94. ⟨10.1016/j.tcs.2018.10.002⟩ Article dans une revue hal-01886947v1
Monotone Simultaneous Paths Embeddings in $\mathbb{R}^d$ David Bremner,Olivier Devillers,Marc Glisse,Sylvain Lazard,Giuseppe Liottaet al. Discrete Mathematics and Theoretical Computer Science, 2018, Vol. 20 no. 1 (1), pp.1-11. ⟨10.23638/DMTCS-20-1-1⟩ Article dans une revue hal-01529154v2
Bivariate triangular decompositions in the presence of asymptotes Sylvain Lazard,Marc Pouget,Fabrice Rouillier Journal of Symbolic Computation, 2017, 82, pp.123 - 133. ⟨10.1016/j.jsc.2017.01.004⟩ Article dans une revue hal-01468796v1
Analysis of Farthest Point Sampling for Approximating Geodesics in a Graph Pegah Kamousi,Sylvain Lazard,Anil Maheshwari,Stefanie Wuhrer Computational Geometry, 2016, 57, pp.1-7. ⟨10.1016/j.comgeo.2016.05.005⟩ Article dans une revue hal-01297624v2
Silhouette of a random polytope Marc Glisse,Sylvain Lazard,Julien Michel,Marc Pouget Journal of Computational Geometry, 2016, 7 (1), pp.14. ⟨10.20382/jocg.v7i1a5⟩ Article dans une revue hal-01289699v1
Recognizing Shrinkable Complexes Is NP-Complete Dominique Attali,Olivier Devillers,Marc Glisse,Sylvain Lazard Journal of Computational Geometry, 2016, 7 (1), pp.430--443. ⟨10.20382/jocg.v7i1a18⟩ Article dans une revue hal-01384396v2
Solving bivariate systems using Rational Univariate Representations Yacine Bouzidi,Sylvain Lazard,Guillaume Moroz,Marc Pouget,Fabrice Rouillieret al. Journal of Complexity, 2016, 37, pp.34--75. ⟨10.1016/j.jco.2016.07.002⟩ Article dans une revue hal-01342211v2
Separating linear forms and Rational Univariate Representations of bivariate systems Yacine Bouzidi,Sylvain Lazard,Marc Pouget,Fabrice Rouillier Journal of Symbolic Computation, 2015, 68, pp.84-119. ⟨10.1016/j.jsc.2014.08.009⟩ Article dans une revue hal-00977671v1
Universal Point Sets for Planar Graph Drawing with Circular Arcs Patrizio Angelini,David Eppstein,Fabrizio Frati,Michael Kaufmann,Sylvain Lazardet al. Journal of Graph Algorithms and Applications, 2014, 18 (3), pp.313-324. ⟨10.7155/jgaa.00324⟩ Article dans une revue hal-00997207v1
On Point-sets that Support Planar Graphs Vida Dujmović,Will Evans,Sylvain Lazard,William Lenhart,Giuseppe Liottaet al. Computational Geometry, 2013, 43 (1), pp.29--50. ⟨10.1016/j.comgeo.2012.03.003⟩ Article dans une revue hal-00684510v1
Bounded-Curvature Shortest Paths through a Sequence of Points using Convex Optimization Xavier Goaoc,Hyo-Sil Kim,Sylvain Lazard SIAM Journal on Computing, 2013, 42 (2), pp.662-684. ⟨10.1137/100816079⟩ Article dans une revue hal-00927100v1
On the Complexity of Sets of Free Lines and Line Segments Among Balls in Three Dimensions Marc Glisse,Sylvain Lazard Discrete and Computational Geometry, 2012, 47 (4), pp.756-772. ⟨10.1007/s00454-012-9414-8⟩ Article dans une revue hal-00643880v1
Farthest-Polygon Voronoi Diagrams Otfried Cheong,Hazel Everett,Marc Glisse,Joachim Gudmundsson,Samuel Hornuset al. Computational Geometry, 2011, Computational Geometry, Theory and Applications, 44 (4), pp.14. ⟨10.1016/j.comgeo.2010.11.004⟩ Article dans une revue inria-00442816v3
Universal Sets of n Points for One-bend Drawings of Planar Graphs with n Vertices Hazel Everett,Sylvain Lazard,Giuseppe Liotta,Steve Wismath Discrete and Computational Geometry, 2010, 43 (2), pp.272-288. ⟨10.1007/s00454-009-9149-3⟩ Article dans une revue inria-00431769v1
A Succinct 3D Visibility Skeleton Sylvain Lazard,Christophe Weibel,Sue Whitesides,Linqiao Zhang Discrete Mathematics, Algorithms and Applications, 2010, 2 (4), pp.1-23. ⟨10.1142/S1793830910000899⟩ Article dans une revue inria-00511233v1
Homotopic Fréchet Distance Between Curves or, Walking Your Dog in the Woods in Polynomial Time Erin Wolf Chambers,Eric Colin de Verdière,Jeff Erickson,Sylvain Lazard,Francis Lazaruset al. Computational Geometry, 2010, Special Issue on 24th Annual Symposium on Computational Geometry (SoCG'08), 43 (3), pp.295-311. ⟨10.1016/j.comgeo.2009.02.008⟩ Article dans une revue inria-00438463v1
On the topology of real algebraic plane curves Jinsan Cheng,Sylvain Lazard,Luis Mariano Peñaranda,Marc Pouget,Fabrice Rouillieret al. Mathematics in Computer Science, 2010, 4 (1), pp.113-137. ⟨10.1007/s11786-010-0044-3⟩ Article dans une revue inria-00517175v1
On the Complexity of Umbra and Penumbra Julien Demouth,Olivier Devillers,Hazel Everett,Marc Glisse,Sylvain Lazardet al. Computational Geometry, 2009, 42 (8), pp.758--771. ⟨10.1016/j.comgeo.2008.04.007⟩ Article dans une revue inria-00431418v1
The Voronoi diagram of three lines Hazel Everett,Daniel Lazard,Sylvain Lazard,Mohab Safey El Din Discrete and Computational Geometry, 2009, 42 (1), pp.94-130. ⟨10.1007/s00454-009-9173-3⟩ Article dans une revue inria-00431518v1
On the Degree of Standard Geometric Predicates for Line Transversals in 3D Hazel Everett,Sylvain Lazard,Bill Lenhart,Linqiao Zhang Computational Geometry, 2009, 42 (5), pp.484-494. ⟨10.1016/j.comgeo.2007.11.002⟩ Article dans une revue inria-00431441v1
An Upper Bound on the Average Size of Silhouettes Marc Glisse,Sylvain Lazard Discrete and Computational Geometry, 2008, 40 (2), pp.241-257. ⟨10.1007/s00454-008-9089-3⟩ Article dans une revue inria-00336571v1
Near-Optimal Parameterization of the Intersection of Quadrics: I. The Generic Algorithm Laurent Dupont,Daniel Lazard,Sylvain Lazard,Sylvain Petitjean Journal of Symbolic Computation, 2008, 43 (3), pp.168--191. ⟨10.1016/j.jsc.2007.10.006⟩ Article dans une revue inria-00186089v1
Near-Optimal Parameterization of the Intersection of Quadrics: II. A Classification of Pencils Laurent Dupont,Daniel Lazard,Sylvain Lazard,Sylvain Petitjean Journal of Symbolic Computation, 2008, 43 (3), pp.192--215. ⟨10.1016/j.jsc.2007.10.012⟩ Article dans une revue inria-00186090v1
Near-Optimal Parameterization of the Intersection of Quadrics: III. Parameterizing Singular Intersections Laurent Dupont,Daniel Lazard,Sylvain Lazard,Sylvain Petitjean Journal of Symbolic Computation, 2008, 43 (3), pp.216--232. ⟨10.1016/j.jsc.2007.10.007⟩ Article dans une revue inria-00186091v1
Parabola separation queries and their application to stone throwing Otfried Cheong,Hazel Everett,Hyo-Sil Kim,Sylvain Lazard,René Schott International Journal of Computational Geometry and Applications, 2007, 17 (4), pp.349-360. ⟨10.1142/S0218195907002379⟩ Article dans une revue inria-00434090v1
On the Expected Size of the 2D Visibility Complex Hazel Everett,Sylvain Lazard,Sylvain Petitjean,Linqiao Zhang International Journal of Computational Geometry and Applications, 2007, 17 (4), pp.361-381. ⟨10.1142/S0218195907002380⟩ Article dans une revue inria-00103926v1
Lines tangent to four triangles in three-dimensional space Hervé Brönnimann,Olivier Devillers,Sylvain Lazard,Frank Sottile Discrete and Computational Geometry, 2007, 37 (3), pp.369-380. ⟨10.1007/s00454-006-1278-3⟩ Article dans une revue inria-00000598v1
Lines and free line segments Tangent to Arbitrary Three-dimensional Convex Polyhedra Hervé Brönnimann,Olivier Devillers,Vida Dujmovic,Hazel Everett,Marc Glisseet al. SIAM Journal on Computing, 2007, 37 (2), pp.522-551. ⟨10.1137/S0097539705447116⟩ Article dans une revue inria-00103916v1
Intersecting Quadrics: An Efficient and Exact Implementation Sylvain Lazard,Luis Mariano Peñaranda,Sylvain Petitjean Computational Geometry, 2006, 35 (1-2), pp.74--99. ⟨10.1016/j.comgeo.2005.10.004⟩ Article dans une revue inria-00000380v1
Common Tangents to Spheres in $R3$ Ciprian Borcea,Xavier Goaoc,Sylvain Lazard,Sylvain Petitjean Discrete and Computational Geometry, 2006, 35 (2), pp.287-300. ⟨10.1007/s00454-005-1230-y⟩ Article dans une revue inria-00100261v1
Drawing Kn in Three Dimensions with One Bend per Edge Olivier Devillers,Hazel Everett,Sylvain Lazard,Maria Pentcheva,Steve Wismath Journal of Graph Algorithms and Applications, 2006, 10 (2), pp.287-295 Article dans une revue inria-00103923v1
Transversals to line segments in three-dimensional space Hervé Brönnimann,Hazel Everett,Sylvain Lazard,Frank Sottile,Sue Whitesides Discrete and Computational Geometry, 2005, 34 (3), pp.381 - 390. ⟨10.1007/s00454-005-1183-1⟩ Article dans une revue inria-00000384v1
A polynomial-time algorithm for computing shortest paths of bounded curvature amidst moderate obstacles Jean-Daniel Boissonnat,Sylvain Lazard International Journal of Computational Geometry and Applications, 2003, 13 (3), pp.189-229. ⟨10.1142/S0218195903001128⟩ Article dans une revue inria-00099509v1
The expected number of 3D visibility events is linear Olivier Devillers,Vida Dujmovic,Hazel Everett,Xavier Goaoc,Sylvain Lazardet al. SIAM Journal on Computing, 2003, 32 (6), pp.1586-1620. ⟨10.1137/S0097539702419662⟩ Article dans une revue inria-00099810v1
Curvature-Constrained Shortest Paths in a Convex Polygon Pankaj K. Agarwal,Thérèse Biedl,Sylvain Lazard,Steve Robbins,Subhash Suriet al. SIAM Journal on Computing, 2002, 31 (6), pp.1814-1851. ⟨10.1137/S0097539700374550⟩ Article dans une revue inria-00100887v1
A Note on Reconfiguring Tree Linkages: Trees can Lock Thérèse Biedl,Erik Demaine,Martin Demaine,Sylvain Lazard,Anna Lubiwet al. Discrete Applied Mathematics, 2002, 117 (1-3), pp.293-297. ⟨10.1016/S0166-218X(01)00229-3⟩ Article dans une revue inria-00100889v1
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, 34 (2), pp.109-156. ⟨10.1007/s00453-002-0950-0⟩ Article dans une revue istex inria-00100533v1
The Virtual Mesh: A Geometric Abstraction for Efficiently Computing Radiosity Laurent Alonso,François Cuny,Sylvain Petitjean,Jean-Claude Paul,Sylvain Lazardet al. ACM Transactions on Graphics, 2001, 20 (3), pp.169-201. ⟨10.1145/501786.501789⟩ Article dans une revue inria-00100429v1
Locked and Unlocked Polygonal Chains in Three Dimensions Thérèse Biedl,Erik Demaine,Martin Demaine,Sylvain Lazard,Anna Lubiwet al. Discrete and Computational Geometry, 2001, 26 (3), pp.269-281. ⟨10.1007/s00454-001-0038-7⟩ Article dans une revue inria-00100521v1
Motion planning of legged robots Jean-Daniel Boissonnat,Olivier Devillers,Sylvain Lazard SIAM Journal on Computing, 2000, 30 (1), pp.218-246. ⟨10.1137/S0097539797326289⟩ Article dans une revue inria-00099289v1

Chapitre d'ouvrage (3)

Algebraic kernel Eric Berberich,Michael Hemmer,Sylvain Lazard,Luis Mariano Peñaranda,Monique Teillaud CGAL Editorial board. CGAL User and Reference Manual, 3.6 edition, CGAL Editorial board, 2010 Chapitre d'ouvrage inria-00537545v1
Towards the Robust Intersection of Implicit Quadrics Laurent Dupont,Daniel Lazard,Sylvain Lazard,Sylvain Petitjean J. Winkler and M. Niranjan. Uncertainty in Geometric Computations, Kluwer Academic Publishers, pp.59-68, 2002, International Series in Engineering and Computer Science Chapitre d'ouvrage inria-00100878v1
Interpolation problem with curvature constraints Hafsa Deddi,Hazel Everett,Sylvain Lazard A. Cohen, C. Rabut & L. L. Schumaker. Curve & Surface Fitting, Vanderbilt University press, 2000 Chapitre d'ouvrage inria-00099245v1

Communication dans un congrès (47)

Numerical Algorithm for the Topology of Singular Plane Curves George Krait,Sylvain Lazard,Guillaume Moroz,Marc Pouget EuroCG 2019 - 35th European Workshop on Computational Geometry, Mar 2019, Utrecht, Netherlands Communication dans un congrès hal-02294028v1
3D Snap Rounding Olivier Devillers,Sylvain Lazard,William Lenhart Proceedings of the 34th International Symposium on Computational Geometry, Jun 2018, Budapest, Hungary. pp.30:1 - 30:14, ⟨10.4230/LIPIcs.SoCG.2018.30⟩ Communication dans un congrès hal-01727375v1
On the Edge-length Ratio of Outerplanar Graphs Sylvain Lazard,William Lenhart,Giuseppe Liotta International Symposium on Graph Drawing and Network Visualization, 2017, Boston, United States Communication dans un congrès hal-01591699v1
Monotone Simultaneous Paths Embeddings in $\mathbb{R}^d$ David Bremner,Olivier Devillers,Marc Glisse,Sylvain Lazard,Giuseppe Liottaet al. 24th International Symposium on Graph Drawing & Network Visualization, Sep 2016, Athens, Greece. ⟨10.1007/978-3-319-50106-2_42⟩ Communication dans un congrès hal-01366148v1
Improved algorithm for computing separating linear forms for bivariate systems Yacine Bouzidi,Sylvain Lazard,Guillaume Moroz,Marc Pouget,Fabrice Rouillier ISSAC - 39th International Symposium on Symbolic and Algebraic Computation, Jul 2014, Kobe, Japan Communication dans un congrès hal-00992634v1
Recognizing shrinkable complexes is NP-complete Dominique Attali,Olivier Devillers,Marc Glisse,Sylvain Lazard ESA 2014 - 22nd Annual European Symposium on Algorithms, Sep 2014, Wroclaw, Poland. pp.74-86, ⟨10.1007/978-3-662-44777-2_7⟩ Communication dans un congrès hal-01015747v1
Rational Univariate Representations of Bivariate Systems and Applications Yacine Bouzidi,Sylvain Lazard,Marc Pouget,Fabrice Rouillier ISSAC - 38th International Symposium on Symbolic and Algebraic Computation, Jun 2013, Boston, United States. pp.109-116 Communication dans un congrès hal-00809430v1
Separating Linear Forms for Bivariate Systems Yacine Bouzidi,Sylvain Lazard,Marc Pouget,Fabrice Rouillier ISSAC - 38th International Symposium on Symbolic and Algebraic Computation, Jun 2013, Boston, United States. pp.117-124 Communication dans un congrès hal-00809425v1
Universal Point Sets for Planar Graph Drawings with Circular Arcs Patrizio Angelini,David Eppstein,Fabrizio Frati,Michael Kaufmann,Sylvain Lazardet al. Canadian Conference on Computational Geometry, Aug 2013, Waterloo, Canada. pp.117-122 Communication dans un congrès hal-00846953v1
New bivariate system solver and topology of algebraic curves Yacine Bouzidi,Sylvain Lazard,Marc Pouget,Fabrice Rouillier 27th European Workshop on Computational Geometry - EuroCG 2011, Mar 2011, Morschach, Switzerland Communication dans un congrès inria-00580431v1
On Point-sets that Support Planar Graphs Vida Dujmović,Will Evans,Sylvain Lazard,William Lenhart,Giuseppe Liottaet al. 19th International Symposium on Graph Drawing, Sep 2011, Eindhoven, Netherlands Communication dans un congrès hal-00643824v1
On the Computation of the 3D Visibility Skeleton Sylvain Lazard,Christophe Weibel,Sue Whitesides,Linqiao Zhang 16th Annual International Computing and Combinatorics Conference - COCOON 2010, Jul 2010, Nha Trang, Vietnam Communication dans un congrès inria-00472839v1
On the Complexity of Sets of Free Lines and Line Segments Among Balls in Three Dimensions Marc Glisse,Sylvain Lazard 26th annual symposium on Computational geometry - SoCG 2010, Jun 2010, Snowbird, Utah, United States. ⟨10.1145/1810959.1810969⟩ Communication dans un congrès inria-00442751v2
Univariate Algebraic Kernel and Application to Arrangements Sylvain Lazard,Luis Mariano Peñaranda,Elias P. P. Tsigaridas 8th International Symposium SEA 2009, Jun 2009, Dortmund, Germany. pp.209-220, ⟨10.1007/978-3-642-02011-7⟩ Communication dans un congrès inria-00431559v1
On the topology of planar algebraic curves Jinsan Cheng,Sylvain Lazard,Luis Mariano Peñaranda,Marc Pouget,Fabrice Rouillieret al. 25th annual symposium on Computational geometry - SCG 2009, Jun 2009, Aarhus, Denmark. pp.361--370, ⟨10.1145/1542362.1542424⟩ Communication dans un congrès inria-00425383v1
The Voronoi diagram of three arbitrary lines in R3 Hazel Everett,Christian Gillot,Daniel Lazard,Sylvain Lazard,Marc Pouget 25th European Workshop on Computational Geometry - EuroCG'09, Mar 2009, Bruxelles, Belgium. pp.297-300 Communication dans un congrès inria-00425378v1
Universal Sets of n Points for 1-bend Drawings of Planar Graphs with n Vertices Hazel Everett,Sylvain Lazard,Giuseppe Liotta,Steve Wismath The 15th International Symposium on Graph Drawing - GD 2007, Sep 2007, Sydney, Australia. pp.345-351, ⟨10.1007/978-3-540-77537-9_34⟩ Communication dans un congrès inria-00189036v1
Predicates for line transversals to lines and line segments in three-dimensional space Olivier Devillers,Marc Glisse,Sylvain Lazard SoCG 2008 - 24th Annual Symposium on Computational Geometry, Jun 2008, College Park, Maryland, United States. pp.174-181, ⟨10.1145/1377676.1377704⟩ Communication dans un congrès inria-00336256v1
A CGAL-based Univariate Algebraic Kernel and Application to Arrangements Sylvain Lazard,Luis Mariano Peñaranda,Elias P. P. Tsigaridas 24th European Workshop on Computational Geometry - EuroCG 2008, Mar 2008, Nancy, France. pp.91--94 Communication dans un congrès inria-00336563v1
On The Topology of Planar Algebraic Curves Jinsan Cheng,Sylvain Lazard,Luis Mariano Peñaranda,Marc Pouget,Fabrice Rouillieret al. 24th European Workshop on Computational Geometry - EuroCG 2008, Mar 2008, Nancy, France. pp.213--216 Communication dans un congrès inria-00329754v1
On the Size of the 3D Visibility Skeleton: Experimental Results Linqiao Zhang,Hazel Everett,Sylvain Lazard,Christophe Weibel,Sue Whitesides 16th Annual European Symposium on Algorithms - ESA 2008, Sep 2008, Karlsruhe, Germany. pp.805--816, ⟨10.1007/978-3-540-87744-8_67⟩ Communication dans un congrès inria-00336502v1
Walking Your Dog in the Woods in Polynomial Time Erin Wolf Chambers,Eric Colin de Verdire,Jeff Erickson,Sylvain Lazard,Francis Lazaruset al. SoCG 2008 - 24th Annual Symposium on Computational Geometry, Jun 2008, College Park, Maryland, United States. pp.101--109, ⟨10.1145/1377676.1377694⟩ Communication dans un congrès inria-00336497v1
The Voronoi Diagram of Three Lines Hazel Everett,Daniel Lazard,Sylvain Lazard,Mohab Safey El Din 23rd Annual Symposium on Computational Geometry (SoCG'07), Hee-Kap Ahn, Otfried Cheong, and Kyung-Yong Chwa, Jun 2007, Gyeongju, South Korea. pp.255-264, ⟨10.1145/1247069.1247116⟩ Communication dans un congrès inria-00186085v1
Between umbra and penumbra Julien Demouth,Olivier Devillers,Hazel Everett,Marc Glisse,Sylvain Lazardet al. Proceedings of the 23rd Annual Symposium on Computational Geometry, Hee-Kap Ahn, Otfried Cheong, and Kyung-Yong Chwa, Jun 2007, Gyeongju, South Korea. pp.265-274, ⟨10.1145/1247069.1247117⟩ Communication dans un congrès inria-00187253v1
Farthest-Polygon Voronoi Diagrams Otfried Cheong,Hazel Everett,Marc Glisse,Joachim Gudmundsson,Samuel Hornuset al. 15th Annual European Symposium on Algorithms - ALGO 2007, Oct 2007, Eilat, Israel. pp.407-418, ⟨10.1007/978-3-540-75520-3_37⟩ Communication dans un congrès inria-00189038v1
Towards an Implementation of the 3D Visibility Skeleton Linqiao Zhang,Hazel Everett,Sylvain Lazard,Sue Whitesides 23rd Annual Symposium on Computational Geometry, Jun 2007, Gyeongju, South Korea. pp.131 - 132, ⟨10.1145/1247069.1247094⟩ Communication dans un congrès inria-00338095v1
Throwing stones in simple polygons Otfried Cheong,Hazel Everett,Sylvain Lazard,Hyo-Sil Kim,René Schott 2nd International Conference on Algorithmic Aspects in Information and Management (AAIM'06), Jun 2006, Hong Kong, China, pp.185-193, ⟨10.1007/11775096_18⟩ Communication dans un congrès istex inria-00103952v1
Predicates for Line Transversals in 3D Hazel Everett,Sylvain Lazard,Bill Lenhart,Jeremy Redburn,Linqiao Zhang 18th Canadian Conference on Computational Geometry - CCCG 2006, Aug 2006, Kingston, Canada Communication dans un congrès inria-00103945v1
An Experimental Assessment of the 2D Visibility Complex Hazel Everett,Sylvain Lazard,Sylvain Petitjean,Linqiao Zhang 17th Canadian Conference on Computational Geometry - CCCG'2005, Aug 2005, Windsor, Canada Communication dans un congrès inria-00000373v2
Drawing $K_n$ in Three Dimensions with One Bend per Edge Olivier Devillers,Hazel Everett,Sylvain Lazard,Maria Pentcheva,Stephen Wismath 13th International Symposium on Graph Drawing - GD'2005, Sep 2005, University of Limerick, Ireland Communication dans un congrès inria-00000374v1
Intersecting Quadrics: An Efficient and Exact Implementation Sylvain Lazard,Luis Peñaranda,Sylvain Petitjean Symposium on Computational Geometry - SoCG'2004, Jun 2004, Brooklyn, NY, United States. pp.419 - 428, ⟨10.1145/997817.997880⟩ Communication dans un congrès inria-00104003v1
The Number of Lines Tangent to Arbitrary Convex Polyhedra in 3D Hervé Brönnimann,Olivier Devillers,Vida Dujmovic,Hazel Everett,Marc Glisseet al. Proceedings of the 20th Annual Symposium on Computational Geometry, Jun 2004, Brooklyn, NY, United States. pp.46 - 55, ⟨10.1145/997817.997827⟩ Communication dans un congrès inria-00103995v1
On the number of line tangents to four triangles in three-dimensional space Hervé Brönnimann,Olivier Devillers,Sylvain Lazard,Frank Sottile 16th Canadian Conference on Computational Geometry - CCCG'04, 2004, Montreal, Canada, 4 p Communication dans un congrès inria-00099873v1
Orientation des pièces artistiques pour le procédé de Stratoconception Geoffroy Lauvaux,Sylvain Lazard,Claude Barlier 10th European Forum on Rapid Prototyping, Sep 2004, Paris, France Communication dans un congrès inria-00104000v1
Near-Optimal Parameterization of the Intersection of Quadrics: Theory and Implementation Laurent Dupont,Sylvain Lazard,Daniel Lazard,Sylvain Petitjean International Conference on Polynomial System Solving - ICPSS 2004, 2004, Paris, France, 3 p Communication dans un congrès inria-00099925v1
Transversals to Line Segments in R3 Hervé Bronnimann,Hazel Everett,Sylvain Lazard,Frank Sottile,Sue Whitesides 15th Canadian Conference on Computational Geometry - CCCG'2003, 2003, Halifax, Canada, 4 p Communication dans un congrès inria-00099479v1
Near-Optimal Parameterization of the Intersection of Quadrics Laurent Dupont,Daniel Lazard,Sylvain Lazard,Sylvain Petitjean 19th Symposium on Computational Geometry - SoCG 2003, Jun 2003, San Diego, United States. pp.246-255, ⟨10.1145/777792.777830⟩ Communication dans un congrès inria-00099789v1
On the Number of Lines Tangent to Four Convex Polyhedra Hervé Brönnimann,Olivier Devillers,Vida Dujmovic,Hazel Everett,Marc Glisseet al. 14th Canadian Conference on Computational Geometry - CCCG'02, 2002, Lethbridge, Canada Communication dans un congrès inria-00099449v1
Géométrie algorithmique pour la CAO et la conception optimale de robots David Daney,Sylvain Lazard,Steve Robbins,Sue Whitesides 68ème Congrés ACFAS, May 2000, Montréal, Canada Communication dans un congrès hal-00906470v1
Locked and Unlocked Polygonal Chains in Three Dimensions Thérèse Biedl,Erik Demaine,Martin Demaine,Sylvain Lazard,Anna Lubiwet al. Symposium on Discrete Algorithms - SODA'99, Jan 1999, Baltimore, United States. pp.866 - 867 Communication dans un congrès inria-00098772v2
Convexifying Monotone Polygons Therese C. Biedl,Erik D. Demaine,Sylvain Lazard,Steven M. Robbins,Michael A. Soss 10th Annual International Symposium on Algorithms & Computation - ISAAC'99, Kamakoti V (IMSC, India) Rangarajan K (MCC, India) Rama R (IIT, Madras, India) Boopal E (IIT, Madras, India), Dec 1999, Chennai, India. 10 p, ⟨10.1007/3-540-46632-0_42⟩ Communication dans un congrès inria-00098832v1
Curvature-Constrained Shortest Paths in a Convex Polygon Pankaj K. Agarwal,Thérèse Biedl,Sylvain Lazard,Steve Robbins,Subhash Suriet al. Symposium on Computational Geometry - SCG 1998, Jun 1998, Mineapolis, United States. pp.392-401, ⟨10.1145/276884.276928⟩ Communication dans un congrès hal-00827890v1
Convexifying Star-Shaped Polygons Hazel Everett,Sylvain Lazard,Steve Robbins,H. Schröder,Sue Whitesides 10th Canadian Conference on Computational Geometry (CCCG'98), 1998, Montreal, Canada. pp.10-12 Communication dans un congrès inria-00442788v1
A polynomial-time algorithm for computing shortest paths of bounded curvature amidst moderate obstacles Jean-Daniel Boissonnat,Sylvain Lazard Symposium on Computational Geometry (SoCG'96), 1996, Philadelphia, United States. pp.242-251, ⟨10.1145/237218.237393⟩ Communication dans un congrès inria-00442806v1
Convex hulls of bounded curvature Jean-Daniel Boissonnat,Sylvain Lazard Canadian Conference on Computational Geometry (CCCG'96), 1996, Ottawa, Canada. pp.14-19 Communication dans un congrès inria-00442802v1
Motion planning of legged robots Jean-Daniel Boissonnat,Olivier Devillers,Sylvain Lazard Workshop on Algorithmic foundations of robotics, 1994, San Francisco?, United States Communication dans un congrès hal-01179461v1
From spider robots to half disk robots Jean-Daniel Boissonnat,Olivier Devillers,Sylvain Lazard IEEE International Conference on Robotics and Automation, 1994, San Diego, United States. pp.953-958 Communication dans un congrès inria-00442776v1

Poster de conférence (1)

One-Bend Drawing of $K_n$ in 3D, revisited Olivier Devillers,Sylvain Lazard Michael A. Bekos; Markus Chimani. The 31st International Symposium on Graph Drawing and Network Visualization, Sep 2023, Palermo, Italy. Springer, 2023 Poster de conférence hal-04195317v1

Rapport (29)

3D Snap Rounding Olivier Devillers,Sylvain Lazard,William Lenhart [Research Report] RR-9149, Inria Nancy - Grand Est. 2018, pp.1-22 Rapport (rapport de recherche) hal-01698928v1
Bivariate Triangular Decompositions in the Presence of Asymptotes Sylvain Lazard,Marc Pouget,Fabrice Rouillier [Research Report] INRIA. 2015 Rapport (rapport de recherche) hal-01200802v1
Improved algorithms for solving bivariate systems via Rational Univariate Representations Yacine Bouzidi,Sylvain Lazard,Guillaume Moroz,Marc Pouget,Fabrice Rouillieret al. [Research Report] Inria. 2015 Rapport (rapport de recherche) hal-01114767v2
Rational Univariate Representations of Bivariate Systems and Applications Yacine Bouzidi,Sylvain Lazard,Marc Pouget,Fabrice Rouillier [Research Report] RR-8262, INRIA. 2013, pp.26 Rapport (rapport de recherche) hal-00802698v2
Silhouette of a random polytope Marc Glisse,Sylvain Lazard,Julien Michel,Marc Pouget [Research Report] RR-8327, INRIA. 2013, pp.13 Rapport (rapport de recherche) hal-00841374v2
Separating linear forms for bivariate systems Yacine Bouzidi,Sylvain Lazard,Marc Pouget,Fabrice Rouillier [Research Report] RR-8261, INRIA. 2013, pp.20 Rapport (rapport de recherche) hal-00802693v2
Analysis of Farthest Point Sampling for Approximating Geodesics in a Graph Pegah Kamousi,Sylvain Lazard,Anil Maheshwari,Stefanie Wuhrer [Research Report] INRIA. 2013, pp.13 Rapport (rapport de recherche) hal-00927643v1
Bounded-Curvature Shortest Paths through a Sequence of Points Xavier Goaoc,Hyo-Sil Kim,Sylvain Lazard [Research Report] RR-7465, INRIA. 2010, pp.53 Rapport (rapport de recherche) inria-00539957v1
Univariate Algebraic Kernel and Application to Arrangements Sylvain Lazard,Luis Peñaranda,Elias P. Tsigaridas [Research Report] RR-6893, INRIA. 2009, pp.17 Rapport (rapport de recherche) inria-00372234v1
On the Complexity of Umbra and Penumbra Julien Demouth,Olivier Devillers,Hazel Everett,Marc Glisse,Sylvain Lazardet al. [Research Report] RR-6347, INRIA. 2007, pp.28 Rapport (rapport de recherche) inria-00186262v2
An Upper Bound on the Average Size of Silhouettes–––Une borne supérieure sur la taille moyenne des silhouettes Marc Glisse,Sylvain Lazard [Research Report] RR-6124, INRIA. 2007 Rapport (rapport de recherche) inria-00130035v2
The Voronoi Diagram of Three Lines Hazel Everett,Daniel Lazard,Sylvain Lazard,Mohab Safey El Din [Research Report] RR-6295, INRIA. 2007, pp.38 Rapport (rapport de recherche) inria-00172749v2
On the Expected Size of the 2D Visibility Complex Hazel Everett,Sylvain Lazard,Sylvain Petitjean,Linqiao Zhang [Research Report] RR-5822, INRIA. 2006, pp.17 Rapport (rapport de recherche) inria-00070203v1
Drawing $K_n$ in Three Dimensions with One Bend per Edge Olivier Devillers,Hazel Everett,Sylvain Lazard,Maria Pentcheva,Stephen Wismath [Research Report] RR-5708, INRIA. 2005 Rapport (rapport de recherche) inria-00071219v1
Near-Optimal Parameterization of the Intersection of Quadrics: III. Parameterizing Singular Intersections Laurent Dupont,Daniel Lazard,Sylvain Lazard,Sylvain Petitjean [Research Report] RR-5669, INRIA. 2005 Rapport (rapport de recherche) inria-00071227v1
Near-Optimal Parameterization of the Intersection of Quadrics: IV. An Efficient and Exact Implementation Sylvain Lazard,Luis Mariano Peñaranda,Sylvain Petitjean [Research Report] RR-5670, INRIA. 2005, pp.30 Rapport (rapport de recherche) inria-00070341v1
Near-Optimal Parameterization of the Intersection of Quadrics: I. The Generic Algorithm Laurent Dupont,Daniel Lazard,Sylvain Lazard,Sylvain Petitjean [Research Report] RR-5667, INRIA. 2005 Rapport (rapport de recherche) inria-00071229v1
On the Number of Maximal Free Line Segments Tangent to Arbitrary Three-dimensional Convex Polyhedra Hervé Brönnimann,Olivier Devillers,Vida Dujmovic,Hazel Everett,Marc Glisseet al. [Research Report] RR-5671, INRIA. 2005 Rapport (rapport de recherche) inria-00071226v1
Lines tangent to four triangles in three-dimensional space Hervé Brönnimann,Olivier Devillers,Sylvain Lazard,Frank Sottile [Research Report] RR-5693, INRIA. 2005 Rapport (rapport de recherche) inria-00071223v1
Near-Optimal Parameterization of the Intersection of Quadrics: II. A Classification of Pencils Laurent Dupont,Daniel Lazard,Sylvain Lazard,Sylvain Petitjean [Research Report] RR-5668, INRIA. 2005 Rapport (rapport de recherche) inria-00071228v1
Common Tangents to Spheres in R^3 Ciprian Borcea,Xavier Goaoc,Sylvain Lazard,Sylvain Petitjean [Research Report] RR-5325, INRIA. 2004, pp.16 Rapport (rapport de recherche) inria-00070675v1
Transversals to Line Segments in R^3 Hervé Brönnimann,Hazel Everett,Sylvain Lazard,Frank Sottile,Sue Whitesides [Research Report] RR-4864, INRIA. 2003 Rapport (rapport de recherche) inria-00071719v1
The expected number of 3D visibility events is linear Olivier Devillers,Vida Dujmovic,Hazel Everett,Xavier Goaoc,Sylvain Lazardet al. [Research Report] RR-4671, INRIA. 2002 Rapport (rapport de recherche) inria-00071914v1
Certificated and Efficient Solver for Intersection of three quadric surfaces Abhishek Pandey,Bernard Mourrain,Sylvain Lazard [Internship report] A00-R-393 || pandey00a, 2000 Rapport inria-00099246v1
Interpolation with Curvature Constraints Hafsa Deddi,Hazel Everett,Sylvain Lazard [Research Report] RR-4064, INRIA. 2000 Rapport (rapport de recherche) inria-00072572v1
On Reconfiguring Tree Linkages: Trees can lock Thérèse Biedl,Erik Demaine,Martin Demaine,Sylvain Lazard,Anna Lubiwet al. [Intern report] A00-R-388 || biedl00a, 2000, 16 p Rapport inria-00099329v1
Curvature-Constrained Shortest Paths in a Convex Polygon Pankaj K. Agarwal,Thérèse Biedl,Sylvain Lazard,Steve Robbins,Subhash Suriet al. [Research Report] RR-4063, INRIA. 2000, pp.59 Rapport (rapport de recherche) inria-00072573v1
Motion Planning of Legged Robots Jean-Daniel Boissonnat,Olivier Devillers,Sylvain Lazard RR-3214, INRIA. 1997 Rapport inria-00073475v1
A Polynomial-Time Algorithm for Computing a Shortest Path of Bounded Curvature Amidst Moderate Obstacles Jean-Daniel Boissonnat,Sylvain Lazard RR-2887, INRIA. 1996 Rapport inria-00073803v1

Autre publication scientifique (1)

On Tangents to Quadric Surfaces Ciprian Borcea,Xavier Goaoc,Sylvain Lazard,Sylvain Petitjean 2004 Autre publication scientifique inria-00431701v1

Pré-publication, Document de travail (3)

Removing self-intersections in 3D meshes while preserving floating-point coordinates Sylvain Lazard,Leo Valque 2025 Pré-publication, Document de travail hal-04907149v1
Drawing $K_n$ in Three Dimensions with One Bend per Edge, revisited Olivier Devillers,Sylvain Lazard 2023 Pré-publication, Document de travail hal-04182069v1
Isolating the singularities of the plane projection of a generic space curve George Krait,Sylvain Lazard,Guillaume Moroz,Marc Pouget 2020 Pré-publication, Document de travail hal-02612412v1