Co-authors

Number of documents

124

Publications of Sylvain Lazard


My Homepage

 

PhD students


Theses1 document

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

Habilitation à diriger des recherches1 document

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

Journal articles40 documents

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

Book sections3 documents

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

Conference papers47 documents

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

Directions of work or proceedings2 documents

Reports29 documents

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

Other publications1 document

  • Ciprian Borcea, Xavier Goaoc, Sylvain Lazard, Sylvain Petitjean. On Tangents to Quadric Surfaces. 2004. ⟨inria-00431701⟩