Sylvain Lazard

ORCID

Publication Activity (10 Years)

Years Active: 1994-2021
Publications (10 Years): 17

Top Venues

CoRR

ISSAC

Theor. Comput. Sci.

Discret. Comput. Geom.

Pierre and Marie Curie University, Paris, France (PHD)

Education History

Pierre and Marie Curie University, Paris, France

PHD

Publications

George Krait, Sylvain Lazard, Guillaume Moroz, Marc Pouget
Certified numerical algorithm for isolating the singularities of the plane projection of generic smooth space curves. J. Comput. Appl. Math. 394 (2021)
Olivier Devillers, Sylvain Lazard, William J. Lenhart
Rounding Meshes in 3D. Discret. Comput. Geom. 64 (1) (2020)
Sylvain Lazard, William J. Lenhart, Giuseppe Liotta
Corrigendum to "On the edge-length ratio of outerplanar graphs" [Theoret. Comput. Sci. 770 (2019) 88-94]. Theor. Comput. Sci. 806 (2020)
Samuel Hornus, Tim Kuipers, Olivier Devillers, Monique Teillaud, Jonàs Martínez, Marc Glisse, Sylvain Lazard, Sylvain Lefebvre
Variable-width contouring for additive manufacturing. ACM Trans. Graph. 39 (4) (2020)
Sylvain Lazard, William J. Lenhart, Giuseppe Liotta
On the edge-length ratio of outerplanar graphs. Theor. Comput. Sci. 770 (2019)
Olivier Devillers, Sylvain Lazard, William J. Lenhart
3D Snap Rounding. SoCG (2018)
David Bremner, Olivier Devillers, Marc Glisse, Sylvain Lazard, Giuseppe Liotta, Tamara Mchedlidze, Guillaume Moroz, Sue Whitesides, Stephen K. Wismath
. Discret. Math. Theor. Comput. Sci. 20 (1) (2018)
Sylvain Lazard, Marc Pouget, Fabrice Rouillier
Bivariate triangular decompositions in the presence of asymptotes. J. Symb. Comput. 82 (2017)
Sylvain Lazard, William Lenhart, Giuseppe Liotta
On the Edge-length Ratio of Outerplanar Graphs. CoRR (2017)
Sylvain Lazard, William Lenhart, Giuseppe Liotta
On the Edge-Length Ratio of Outerplanar Graphs. Graph Drawing (2017)
David Bremner, Olivier Devillers, Marc Glisse, Sylvain Lazard, Giuseppe Liotta, Tamara Mchedlidze, Sue Whitesides, Stephen K. Wismath
Monotone Simultaneous Embeddings of Paths in R^d. CoRR (2016)
Pegah Kamousi, Sylvain Lazard, Anil Maheshwari, Stefanie Wuhrer
Analysis of farthest point sampling for approximating geodesics in a graph. Comput. Geom. 57 (2016)
Yacine Bouzidi, Sylvain Lazard, Guillaume Moroz, Marc Pouget, Fabrice Rouillier, Michael Sagraloff
Solving bivariate systems using Rational Univariate Representations. J. Complex. 37 (2016)
Marc Glisse, Sylvain Lazard, Julien Michel, Marc Pouget
Silhouette of a random polytope. J. Comput. Geom. 7 (1) (2016)
Dominique Attali, Olivier Devillers, Marc Glisse, Sylvain Lazard
Recognizing shrinkable complexes is NP-complete. J. Comput. Geom. 7 (1) (2016)
David Bremner, Olivier Devillers, Marc Glisse, Sylvain Lazard, Giuseppe Liotta, Tamara Mchedlidze, Sue Whitesides, Stephen K. Wismath
Monotone Simultaneous Embeddings of Paths in d Dimensions. Graph Drawing (2016)
Yacine Bouzidi, Sylvain Lazard, Marc Pouget, Fabrice Rouillier
Separating linear forms and Rational Univariate Representations of bivariate systems. J. Symb. Comput. 68 (2015)
Yacine Bouzidi, Sylvain Lazard, Guillaume Moroz, Marc Pouget, Fabrice Rouillier
Improved algorithm for computing separating linear forms for bivariate systems. CoRR (2014)
Dominique Attali, Olivier Devillers, Marc Glisse, Sylvain Lazard
Recognizing Shrinkable Complexes Is NP-Complete. ESA (2014)
Yacine Bouzidi, Sylvain Lazard, Guillaume Moroz, Marc Pouget, Fabrice Rouillier
Improved algorithm for computing separating linear forms for bivariate systems. ISSAC (2014)
Patrizio Angelini, David Eppstein, Fabrizio Frati, Michael Kaufmann, Sylvain Lazard, Tamara Mchedlidze, Monique Teillaud, Alexander Wolff
Universal Point Sets for Drawing Planar Graphs with Circular Arcs. J. Graph Algorithms Appl. 18 (3) (2014)
Yacine Bouzidi, Sylvain Lazard, Marc Pouget, Fabrice Rouillier
Rational univariate representations of bivariate systems and applications. ISSAC (2013)
Patrizio Angelini, David Eppstein, Fabrizio Frati, Michael Kaufmann, Sylvain Lazard, Tamara Mchedlidze, Monique Teillaud, Alexander Wolff
Universal Point Sets for Planar Graph Drawings with Circular Arcs. CCCG (2013)
Yacine Bouzidi, Sylvain Lazard, Marc Pouget, Fabrice Rouillier
Solving bivariate systems: Efficient worst-case algorithm for computing Rational Univariate Representations and applications CoRR (2013)
Yacine Bouzidi, Sylvain Lazard, Marc Pouget, Fabrice Rouillier
Separating linear forms for bivariate systems CoRR (2013)
Yacine Bouzidi, Sylvain Lazard, Marc Pouget, Fabrice Rouillier
Separating linear forms for bivariate systems. ISSAC (2013)
Vida Dujmovic, William S. Evans, Sylvain Lazard, William Lenhart, Giuseppe Liotta, David Rappaport, Stephen K. Wismath
On point-sets that support planar graphs. Comput. Geom. 46 (1) (2013)
Pegah Kamousi, Sylvain Lazard, Anil Maheshwari, Stefanie Wuhrer
Analysis of Farthest Point Sampling for Approximating Geodesics in a Graph. CoRR (2013)
Xavier Goaoc, Hyo-Sil Kim, Sylvain Lazard
Bounded-Curvature Shortest Paths through a Sequence of Points Using Convex Optimization. SIAM J. Comput. 42 (2) (2013)
Marc Glisse, Sylvain Lazard
On the Complexity of Sets of Free Lines and Line Segments Among Balls in Three Dimensions. Discret. Comput. Geom. 47 (4) (2012)
Vida Dujmovic, William S. Evans, Sylvain Lazard, William Lenhart, Giuseppe Liotta, David Rappaport, Stephen K. Wismath
On Point-Sets That Support Planar Graphs. Graph Drawing (2011)
Otfried Cheong, Hazel Everett, Marc Glisse, Joachim Gudmundsson, Samuel Hornus, Sylvain Lazard, Mira Lee, Hyeon-Suk Na
Farthest-polygon Voronoi diagrams. Comput. Geom. 44 (4) (2011)
Marc Glisse, Sylvain Lazard
On the complexity of sets of free lines and line segments among balls in three dimensions. SCG (2010)
Hazel Everett, Sylvain Lazard, Giuseppe Liotta, Stephen K. Wismath
Vertices. Discret. Comput. Geom. 43 (2) (2010)
Sylvain Lazard
Editorial. Comput. Geom. 43 (2) (2010)
Erin W. Chambers, Éric Colin de Verdière, Jeff Erickson, Sylvain Lazard, Francis Lazarus, Shripad Thite
Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time. Comput. Geom. 43 (3) (2010)
Sylvain Lazard, Christophe Weibel, Sue Whitesides, Linqiao Zhang
On the Computation of 3D Visibility Skeletons. COCOON (2010)
Sylvain Lazard, Christophe Weibel, Sue Whitesides, Linqiao Zhang
A Succinct 3D Visibility Skeleton. Discret. Math. Algorithms Appl. 2 (4) (2010)
Laureano González-Vega, Sylvain Lazard
Foreword. Math. Comput. Sci. 4 (1) (2010)
Jin-San Cheng, Sylvain Lazard, Luis Mariano Peñaranda, Marc Pouget, Fabrice Rouillier, Elias P. Tsigaridas
On the Topology of Real Algebraic Plane Curves. Math. Comput. Sci. 4 (1) (2010)
Otfried Cheong, Hazel Everett, Marc Glisse, Joachim Gudmundsson, Samuel Hornus, Sylvain Lazard, Mira Lee, Hyeon-Suk Na
Farthest-Polygon Voronoi Diagrams CoRR (2010)
Sylvain Lazard, Luis Mariano Peñaranda, Elias P. Tsigaridas
Univariate Algebraic Kernel and Application to Arrangements. SEA (2009)
Jin-San Cheng, Sylvain Lazard, Luis Mariano Peñaranda, Marc Pouget, Fabrice Rouillier, Elias P. Tsigaridas
On the topology of planar algebraic curves. SCG (2009)
Hazel Everett, Sylvain Lazard, William Lenhart, Linqiao Zhang
On the degree of standard geometric predicates for line transversals in 3D. Comput. Geom. 42 (5) (2009)
Hazel Everett, Daniel Lazard, Sylvain Lazard, Mohab Safey El Din
The Voronoi Diagram of Three Lines. Discret. Comput. Geom. 42 (1) (2009)
Julien Demouth, Olivier Devillers, Hazel Everett, Marc Glisse, Sylvain Lazard, Raimund Seidel
On the complexity of umbra and penumbra. Comput. Geom. 42 (8) (2009)
Laurent Dupont, Daniel Lazard, Sylvain Lazard, Sylvain Petitjean
Near-optimal parameterization of the intersection of quadrics: I. The generic algorithm. J. Symb. Comput. 43 (3) (2008)
Laurent Dupont, Daniel Lazard, Sylvain Lazard, Sylvain Petitjean
Near-optimal parameterization of the intersection of quadrics: III. Parameterizing singular intersections. J. Symb. Comput. 43 (3) (2008)
Marc Glisse, Sylvain Lazard
An Upper Bound on the Average Size of Silhouettes. Discret. Comput. Geom. 40 (2) (2008)
Laurent Dupont, Daniel Lazard, Sylvain Lazard, Sylvain Petitjean
Near-optimal parameterization of the intersection of quadrics: II. A classification of pencils. J. Symb. Comput. 43 (3) (2008)
Linqiao Zhang, Hazel Everett, Sylvain Lazard, Christophe Weibel, Sue Whitesides
On the Size of the 3D Visibility Skeleton: Experimental Results. ESA (2008)
Erin W. Chambers, Éric Colin de Verdière, Jeff Erickson, Sylvain Lazard, Francis Lazarus, Shripad Thite
Walking your dog in the woods in polynomial time. SCG (2008)
Olivier Devillers, Marc Glisse, Sylvain Lazard
Predicates for line transversals to lines and line segments in three-dimensional space. SCG (2008)
Linqiao Zhang, Hazel Everett, Sylvain Lazard, Sue Whitesides
Towards an implementation of the 3D visibility skeleton. SCG (2007)
Otfried Cheong, Hazel Everett, Hyo-Sil Kim, Sylvain Lazard, René Schott
Parabola Separation Queries and their Application to Stone Throwing. Int. J. Comput. Geom. Appl. 17 (4) (2007)
Hazel Everett, Sylvain Lazard, Giuseppe Liotta, Stephen K. Wismath
Vertices. Graph Drawing (2007)
Hazel Everett, Sylvain Lazard, Daniel Lazard, Mohab Safey El Din
The voronoi diagram of three lines. SCG (2007)
Marc Glisse, Sylvain Lazard
An Upper Bound on the Average Size of Silhouettes CoRR (2007)
Hazel Everett, Sylvain Lazard, Sylvain Petitjean, Linqiao Zhang
On the Expected Size of the 2D Visibility Complex. Int. J. Comput. Geom. Appl. 17 (4) (2007)
Hervé Brönnimann, Olivier Devillers, Sylvain Lazard, Frank Sottile
Lines Tangent to Four Triangles in Three-Dimensional Space. Discret. Comput. Geom. 37 (3) (2007)
Otfried Cheong, Hazel Everett, Marc Glisse, Joachim Gudmundsson, Samuel Hornus, Sylvain Lazard, Mira Lee, Hyeon-Suk Na
Farthest-Polygon Voronoi Diagrams. ESA (2007)
Hervé Brönnimann, Olivier Devillers, Vida Dujmovic, Hazel Everett, Marc Glisse, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sue Whitesides
Lines and Free Line Segments Tangent to Arbitrary Three-Dimensional Convex Polyhedra. SIAM J. Comput. 37 (2) (2007)
Julien Demouth, Olivier Devillers, Hazel Everett, Marc Glisse, Sylvain Lazard, Raimund Seidel
Between umbra and penumbra. SCG (2007)
Ciprian Borcea, Xavier Goaoc, Sylvain Lazard, Sylvain Petitjean
. Discret. Comput. Geom. 35 (2) (2006)
Sylvain Lazard, Luis Mariano Peñaranda, Sylvain Petitjean
Intersecting quadrics: an efficient and exact implementation. Comput. Geom. 35 (1-2) (2006)
Olivier Devillers, Hazel Everett, Sylvain Lazard, Maria Pentcheva, Stephen K. Wismath
Drawing Kn in Three Dimensions with One Bend per Edge. J. Graph Algorithms Appl. 10 (2) (2006)
Otfried Cheong, Hazel Everett, Hyo-Sil Kim, Sylvain Lazard, René Schott
Throwing Stones Inside Simple Polygons . AAIM (2006)
Hazel Everett, Sylvain Lazard, William J. Lenhart, Jeremy Redburn, Linqiao Zhang
Predicates for Line Transversals in 3D. CCCG (2006)
Hervé Brönnimann, Hazel Everett, Sylvain Lazard, Frank Sottile, Sue Whitesides
Transversals to Line Segments in Three-Dimensional Space. Discret. Comput. Geom. 34 (3) (2005)
Olivier Devillers, Hazel Everett, Sylvain Lazard, Maria Pentcheva, Stephen K. Wismath
in Three Dimensions with One Bend Per Edge. Graph Drawing (2005)
Hazel Everett, Sylvain Lazard, Sylvain Petitjean, Linqiao Zhang
An Experimental Assessment of the 2D Visibility Complex. CCCG (2005)
Hervé Brönnimann, Olivier Devillers, Vida Dujmovic, Hazel Everett, Marc Glisse, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sue Whitesides
The number of lines tangent to arbitrary convex polyhedra in 3D. SCG (2004)
Hervé Brönnimann, Olivier Devillers, Sylvain Lazard, Frank Sottile
On the number of line tangents to four triangles in three-dimensional space. CCCG (2004)
Sylvain Lazard, Luis Mariano Peñaranda, Sylvain Petitjean
Intersecting quadrics: an efficient and exact implementation. SCG (2004)
Olivier Devillers, Vida Dujmovic, Hazel Everett, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sylvain Petitjean
The Expected Number of 3D Visibility Events Is Linear. SIAM J. Comput. 32 (6) (2003)
Hervé Brönnimann, Hazel Everett, Sylvain Lazard, Frank Sottile, Sue Whitesides
. CCCG (2003)
Jean-Daniel Boissonnat, Sylvain Lazard
A Polynomial-Time Algorithm for Computing Shortest Paths of Bounded Curvature AmidstModerate Obstacles. Int. J. Comput. Geom. Appl. 13 (3) (2003)
Laurent Dupont, Daniel Lazard, Sylvain Lazard, Sylvain Petitjean
Near-optimal parameterization of the intersection of quadrics. SCG (2003)
Hervé Brönnimann, Hazel Everett, Sylvain Lazard, Frank Sottile, Sue Whitesides
The number of transversals to line segments in R^3 CoRR (2003)
Pankaj K. Agarwal, Therese C. Biedl, Sylvain Lazard, Steve Robbins, Subhash Suri, Sue Whitesides
Curvature-Constrained Shortest Paths in a Convex Polygon. SIAM J. Comput. 31 (6) (2002)
Hervé Brönnimann, Olivier Devillers, Vida Dujmovic, Hazel Everett, Marc Glisse, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sue Whitesides
On the number of lines tangent to four convex polyhedra. CCCG (2002)
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 34 (2) (2002)
Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides
A note on reconfiguring tree linkages: trees can lock. Discret. Appl. Math. 117 (1-3) (2002)
Laurent Alonso, François Cuny, Sylvain Petitjean, Jean-Claude Paul, Sylvain Lazard, Eric Wies
The virtual mesh: a geometric abstraction for efficiently computing radiosity. ACM Trans. Graph. 20 (3) (2001)
Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Mark H. Overmars, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides
Locked and Unlocked Polygonal Chains in Three Dimensions. Discret. Comput. Geom. 26 (3) (2001)
Jean-Daniel Boissonnat, Olivier Devillers, Sylvain Lazard
Motion Planning of Legged Robots. SIAM J. Comput. 30 (1) (2000)
Therese C. Biedl, Erik D. Demaine, Sylvain Lazard, Steven M. Robbins, Michael A. Soss
Convexifying Monotone Polygons. ISAAC (1999)
Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Mark H. Overmars, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides
Locked and Unlocked Polygonal Chains in 3D CoRR (1999)
Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Mark H. Overmars, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides
Locked and Unlocked Polygonal Chains in 3D. SODA (1999)
Jean-Daniel Boissonnat, Olivier Devillers, Sylvain Lazard
Motion Planning of Legged Robots CoRR (1999)
Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides
On Reconfiguring Tree Linkages: Trees can Lock CoRR (1999)
Hazel Everett, Sylvain Lazard, Steven M. Robbins, H. Schröder, Sue Whitesides
Convexifying star-shaped polygons. CCCG (1998)
Pankaj K. Agarwal, Therese C. Biedl, Sylvain Lazard, Steve Robbins, Subhash Suri, Sue Whitesides
Curvature-Constrained Shortest Paths in a Convex Polygon (Extended Abstract). SCG (1998)
Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Mark H. Overmars, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides
Locked and Unlocked Polygonal Chains in 3D CoRR (1998)
Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides
On reconfiguring tree linkages: Trees can lock. CCCG (1998)
Jean-Daniel Boissonnat, Sylvain Lazard
A Polynomial-Time Algorithm for Computing a Shortest Path of Bounded Curvature Amidst Moderate Obstacles (Extended Abstract). SCG (1996)
Jean-Daniel Boissonnat, Sylvain Lazard
Convex Hulls of Bounded Curvature. CCCG (1996)
Jean-Daniel Boissonnat, Olivier Devillers, Sylvain Lazard
From Spider Robots to Half Disk Robots. ICRA (1994)

Sylvain Lazard.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Sylvain Lazard