Sylvain Lazard

According to our database, Sylvain Lazard authored at least 83 papers between 1994 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2021

Certified numerical algorithm for isolating the singularities of the plane projection of generic smooth space curves.

George Krait, Sylvain Lazard, Guillaume Moroz, Marc Pouget

J. Comput. Appl. Math., 2021

2020

Variable-width contouring for additive manufacturing.

Samuel Hornus, Tim Kuipers, Olivier Devillers, Monique Teillaud, Jonàs Martínez, Marc Glisse, Sylvain Lazard, Sylvain Lefebvre

ACM Trans. Graph., 2020

Corrigendum to "On the edge-length ratio of outerplanar graphs" [Theoret. Comput. Sci. 770 (2019) 88-94].

Sylvain Lazard, William J. Lenhart, Giuseppe Liotta

Theor. Comput. Sci., 2020

Rounding Meshes in 3D.

Olivier Devillers, Sylvain Lazard, William J. Lenhart

Discret. Comput. Geom., 2020

2019

On the edge-length ratio of outerplanar graphs.

Sylvain Lazard, William J. Lenhart, Giuseppe Liotta

Theor. Comput. Sci., 2019

2018

Monotone Simultaneous Paths Embeddings in ℝ^d.

David Bremner, Olivier Devillers, Marc Glisse, Sylvain Lazard, Giuseppe Liotta, Tamara Mchedlidze, Guillaume Moroz, Sue Whitesides, Stephen K. Wismath

Discret. Math. Theor. Comput. Sci., 2018

3D Snap Rounding.

Olivier Devillers, Sylvain Lazard, William J. Lenhart

Proceedings of the 34th International Symposium on Computational Geometry, 2018

2017

Bivariate triangular decompositions in the presence of asymptotes.

Sylvain Lazard, Marc Pouget, Fabrice Rouillier

J. Symb. Comput., 2017

2016

Silhouette of a random polytope.

Marc Glisse, Sylvain Lazard, Julien Michel, Marc Pouget

J. Comput. Geom., 2016

Recognizing shrinkable complexes is NP-complete.

Dominique Attali, Olivier Devillers, Marc Glisse, Sylvain Lazard

J. Comput. Geom., 2016

Solving bivariate systems using Rational Univariate Representations.

Yacine Bouzidi, Sylvain Lazard, Guillaume Moroz, Marc Pouget, Fabrice Rouillier, Michael Sagraloff

J. Complex., 2016

Monotone Simultaneous Embeddings of Paths in R^d.

David Bremner, Olivier Devillers, Marc Glisse, Sylvain Lazard, Giuseppe Liotta, Tamara Mchedlidze, Sue Whitesides, Stephen K. Wismath

CoRR, 2016

Analysis of farthest point sampling for approximating geodesics in a graph.

Pegah Kamousi, Sylvain Lazard, Anil Maheshwari, Stefanie Wuhrer

Comput. Geom., 2016

Monotone Simultaneous Embeddings of Paths in d Dimensions.

David Bremner, Olivier Devillers, Marc Glisse, Sylvain Lazard, Giuseppe Liotta, Tamara Mchedlidze, Sue Whitesides, Stephen K. Wismath

Proceedings of the Graph Drawing and Network Visualization - 24th International Symposium, 2016

2015

Separating linear forms and Rational Univariate Representations of bivariate systems.

Yacine Bouzidi, Sylvain Lazard, Marc Pouget, Fabrice Rouillier

J. Symb. Comput., 2015

2014

Universal Point Sets for Drawing Planar Graphs with Circular Arcs.

Patrizio Angelini, David Eppstein, Fabrizio Frati, Michael Kaufmann, Sylvain Lazard, Tamara Mchedlidze, Monique Teillaud, Alexander Wolff

J. Graph Algorithms Appl., 2014

Improved algorithm for computing separating linear forms for bivariate systems.

Yacine Bouzidi, Sylvain Lazard, Guillaume Moroz, Marc Pouget, Fabrice Rouillier

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2014

2013

Bounded-Curvature Shortest Paths through a Sequence of Points Using Convex Optimization.

Xavier Goaoc, Hyo-Sil Kim, Sylvain Lazard

SIAM J. Comput., 2013

Solving bivariate systems: Efficient worst-case algorithm for computing Rational Univariate Representations and applications

Yacine Bouzidi, Sylvain Lazard, Marc Pouget, Fabrice Rouillier

CoRR, 2013

On point-sets that support planar graphs.

Vida Dujmovic, William S. Evans, Sylvain Lazard, William J. Lenhart, Giuseppe Liotta, David Rappaport, Stephen K. Wismath

Comput. Geom., 2013

Separating linear forms for bivariate systems.

Yacine Bouzidi, Sylvain Lazard, Marc Pouget, Fabrice Rouillier

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2013

Rational univariate representations of bivariate systems and applications.

Yacine Bouzidi, Sylvain Lazard, Marc Pouget, Fabrice Rouillier

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2013

Universal Point Sets for Planar Graph Drawings with Circular Arcs.

Patrizio Angelini, David Eppstein, Fabrizio Frati, Michael Kaufmann, Sylvain Lazard, Tamara Mchedlidze, Monique Teillaud, Alexander Wolff

Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

2012

On the Complexity of Sets of Free Lines and Line Segments Among Balls in Three Dimensions.

Marc Glisse, Sylvain Lazard

Discret. Comput. Geom., 2012

2011

Farthest-polygon Voronoi diagrams.

Otfried Cheong, Hazel Everett, Marc Glisse, Joachim Gudmundsson, Samuel Hornus, Sylvain Lazard, Mira Lee, Hyeon-Suk Na

Comput. Geom., 2011

2010

Foreword.

Laureano González-Vega, Sylvain Lazard

Math. Comput. Sci., 2010

On the Topology of Real Algebraic Plane Curves.

Jin-San Cheng, Sylvain Lazard, Luis Mariano Peñaranda, Marc Pouget, Fabrice Rouillier, Elias P. Tsigaridas

Math. Comput. Sci., 2010

A Succinct 3D Visibility Skeleton.

Sylvain Lazard, Christophe Weibel, Sue Whitesides, Linqiao Zhang

Discret. Math. Algorithms Appl., 2010

Universal Sets of <i>n</i> Points for One-bend Drawings of Planar Graphs with <i>n</i> Vertices.

Hazel Everett, Sylvain Lazard, Giuseppe Liotta, Stephen K. Wismath

Discret. Comput. Geom., 2010

Editorial.

Sylvain Lazard

Comput. Geom., 2010

Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time.

Erin W. Chambers, Éric Colin de Verdière, Jeff Erickson, Sylvain Lazard, Francis Lazarus, Shripad Thite

Comput. Geom., 2010

On the Computation of 3D Visibility Skeletons.

Sylvain Lazard, Christophe Weibel, Sue Whitesides, Linqiao Zhang

Proceedings of the Computing and Combinatorics, 16th Annual International Conference, 2010

2009

The Voronoi Diagram of Three Lines.

Hazel Everett, Daniel Lazard, Sylvain Lazard, Mohab Safey El Din

Discret. Comput. Geom., 2009

On the degree of standard geometric predicates for line transversals in 3D.

Hazel Everett, Sylvain Lazard, William J. Lenhart, Linqiao Zhang

Comput. Geom., 2009

On the complexity of umbra and penumbra.

Julien Demouth, Olivier Devillers, Hazel Everett, Marc Glisse, Sylvain Lazard, Raimund Seidel

Comput. Geom., 2009

Univariate Algebraic Kernel and Application to Arrangements.

Sylvain Lazard, Luis Mariano Peñaranda, Elias P. Tsigaridas

Proceedings of the Experimental Algorithms, 8th International Symposium, 2009

On the topology of planar algebraic curves.

Jin-San Cheng, Sylvain Lazard, Luis Mariano Peñaranda, Marc Pouget, Fabrice Rouillier, Elias P. Tsigaridas

Proceedings of the 25th ACM Symposium on Computational Geometry, 2009

2008

Near-optimal parameterization of the intersection of quadrics: III. Parameterizing singular intersections.

Laurent Dupont, Daniel Lazard, Sylvain Lazard, Sylvain Petitjean

J. Symb. Comput., 2008

Near-optimal parameterization of the intersection of quadrics: II. A classification of pencils.

Laurent Dupont, Daniel Lazard, Sylvain Lazard, Sylvain Petitjean

J. Symb. Comput., 2008

Near-optimal parameterization of the intersection of quadrics: I. The generic algorithm.

Laurent Dupont, Daniel Lazard, Sylvain Lazard, Sylvain Petitjean

J. Symb. Comput., 2008

An Upper Bound on the Average Size of Silhouettes.

Marc Glisse, Sylvain Lazard

Discret. Comput. Geom., 2008

On the Size of the 3D Visibility Skeleton: Experimental Results.

Linqiao Zhang, Hazel Everett, Sylvain Lazard, Christophe Weibel, Sue Whitesides

Proceedings of the Algorithms, 2008

Predicates for line transversals to lines and line segments in three-dimensional space.

Olivier Devillers, Marc Glisse, Sylvain Lazard

Proceedings of the 24th ACM Symposium on Computational Geometry, 2008

Walking your dog in the woods in polynomial time.

Erin W. Chambers, Éric Colin de Verdière, Jeff Erickson, Sylvain Lazard, Francis Lazarus, Shripad Thite

Proceedings of the 24th ACM Symposium on Computational Geometry, 2008

2007

Lines and Free Line Segments Tangent to Arbitrary Three-Dimensional Convex Polyhedra.

Hervé Brönnimann, Olivier Devillers, Vida Dujmovic, Hazel Everett, Marc Glisse, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sue Whitesides

SIAM J. Comput., 2007

On the Expected Size of the 2D Visibility Complex.

Hazel Everett, Sylvain Lazard, Sylvain Petitjean, Linqiao Zhang

Int. J. Comput. Geom. Appl., 2007

Parabola Separation Queries and their Application to Stone Throwing.

Otfried Cheong, Hazel Everett, Hyo-Sil Kim, Sylvain Lazard, René Schott

Int. J. Comput. Geom. Appl., 2007

Lines Tangent to Four Triangles in Three-Dimensional Space.

Hervé Brönnimann, Olivier Devillers, Sylvain Lazard, Frank Sottile

Discret. Comput. Geom., 2007

Universal Sets of <i>n</i> Points for 1-Bend Drawings of Planar Graphs with <i>n</i> Vertices.

Hazel Everett, Sylvain Lazard, Giuseppe Liotta, Stephen K. Wismath

Proceedings of the Graph Drawing, 15th International Symposium, 2007

Towards an implementation of the 3D visibility skeleton.

Linqiao Zhang, Hazel Everett, Sylvain Lazard, Sue Whitesides

Proceedings of the 23rd ACM Symposium on Computational Geometry, 2007

Between umbra and penumbra.

Julien Demouth, Olivier Devillers, Hazel Everett, Marc Glisse, Sylvain Lazard, Raimund Seidel

Proceedings of the 23rd ACM Symposium on Computational Geometry, 2007

Problèmes de Géométrie Algorithmique sur les Droites et les Quadriques en Trois Dimensions. (Non-Linear Computational Geometry for Lines and Quadrics in Three Dimensions).

Sylvain Lazard

, 2007

2006

Drawing Kn in Three Dimensions with One Bend per Edge.

Olivier Devillers, Hazel Everett, Sylvain Lazard, Maria Pentcheva, Stephen K. Wismath

J. Graph Algorithms Appl., 2006

Common Tangents to Spheres in R³.

Ciprian Borcea, Xavier Goaoc, Sylvain Lazard, Sylvain Petitjean

Discret. Comput. Geom., 2006

Intersecting quadrics: an efficient and exact implementation.

Sylvain Lazard, Luis Mariano Peñaranda, Sylvain Petitjean

Comput. Geom., 2006

Predicates for Line Transversals in 3D.

Hazel Everett, Sylvain Lazard, William J. Lenhart, Jeremy Redburn, Linqiao Zhang

Proceedings of the 18th Annual Canadian Conference on Computational Geometry, 2006

Throwing Stones Inside Simple Polygons .

Otfried Cheong, Hazel Everett, Hyo-Sil Kim, Sylvain Lazard, René Schott

Proceedings of the Algorithmic Aspects in Information and Management, 2006

2005

Transversals to Line Segments in Three-Dimensional Space.

Hervé Brönnimann, Hazel Everett, Sylvain Lazard, Frank Sottile, Sue Whitesides

Discret. Comput. Geom., 2005

Drawing <i>K</i>_<i>n</i> in Three Dimensions with One Bend Per Edge.

Olivier Devillers, Hazel Everett, Sylvain Lazard, Maria Pentcheva, Stephen K. Wismath

Proceedings of the Graph Drawing, 13th International Symposium, 2005

An Experimental Assessment of the 2D Visibility Complex.

Hazel Everett, Sylvain Lazard, Sylvain Petitjean, Linqiao Zhang

Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

2004

The number of lines tangent to arbitrary convex polyhedra in 3D.

Hervé Brönnimann, Olivier Devillers, Vida Dujmovic, Hazel Everett, Marc Glisse, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sue Whitesides

Proceedings of the 20th ACM Symposium on Computational Geometry, 2004

On the number of line tangents to four triangles in three-dimensional space.

Hervé Brönnimann, Olivier Devillers, Sylvain Lazard, Frank Sottile

Proceedings of the 16th Canadian Conference on Computational Geometry, 2004

2003

The Expected Number of 3D Visibility Events Is Linear.

Olivier Devillers, Vida Dujmovic, Hazel Everett, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sylvain Petitjean

SIAM J. Comput., 2003

A Polynomial-Time Algorithm for Computing Shortest Paths of Bounded Curvature AmidstModerate Obstacles.

Jean-Daniel Boissonnat, Sylvain Lazard

Int. J. Comput. Geom. Appl., 2003

The number of transversals to line segments in R^3

Hervé Brönnimann, Hazel Everett, Sylvain Lazard, Frank Sottile, Sue Whitesides

CoRR, 2003

Near-optimal parameterization of the intersection of quadrics.

Laurent Dupont, Daniel Lazard, Sylvain Lazard, Sylvain Petitjean

Proceedings of the 19th ACM Symposium on Computational Geometry, 2003

Transversals to line segments in R³.

Hervé Brönnimann, Hazel Everett, Sylvain Lazard, Frank Sottile, Sue Whitesides

Proceedings of the 15th Canadian Conference on Computational Geometry, 2003

2002

Curvature-Constrained Shortest Paths in a Convex Polygon.

Pankaj K. Agarwal, Therese C. Biedl, Sylvain Lazard, Steve Robbins, Subhash Suri, Sue Whitesides

SIAM J. Comput., 2002

A note on reconfiguring tree linkages: trees can lock.

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

Discret. Appl. Math., 2002

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

On the number of lines tangent to four convex polyhedra.

Hervé Brönnimann, Olivier Devillers, Vida Dujmovic, Hazel Everett, Marc Glisse, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sue Whitesides

Proceedings of the 14th Canadian Conference on Computational Geometry, 2002

2001

The virtual mesh: a geometric abstraction for efficiently computing radiosity.

Laurent Alonso, François Cuny, Sylvain Petitjean, Jean-Claude Paul, Sylvain Lazard, Eric Wies

ACM Trans. Graph., 2001

Locked and Unlocked Polygonal Chains in Three Dimensions.

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

Discret. Comput. Geom., 2001

2000

Motion Planning of Legged Robots.

Jean-Daniel Boissonnat, Olivier Devillers, Sylvain Lazard

SIAM J. Comput., 2000

1999

Locked and Unlocked Polygonal Chains in 3D.

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

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Convexifying Monotone Polygons.

Therese C. Biedl, Erik D. Demaine, Sylvain Lazard, Steven M. Robbins, Michael A. Soss

Proceedings of the Algorithms and Computation, 10th International Symposium, 1999

1998

Curvature-Constrained Shortest Paths in a Convex Polygon (Extended Abstract).

Pankaj K. Agarwal, Therese C. Biedl, Sylvain Lazard, Steve Robbins, Subhash Suri, Sue Whitesides

Proceedings of the Fourteenth Annual Symposium on Computational Geometry, 1998

Convexifying star-shaped polygons.

Hazel Everett, Sylvain Lazard, Steven M. Robbins, H. Schröder, Sue Whitesides

Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

On reconfiguring tree linkages: Trees can lock.

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

Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

1996

Planification de trajectoires de robots mobiles non-holonomes et de robots à pattes. (Motion planning of non-holonomic mobile robots and legged robots).

Sylvain Lazard

PhD thesis, 1996

A Polynomial-Time Algorithm for Computing a Shortest Path of Bounded Curvature Amidst Moderate Obstacles (Extended Abstract).

Jean-Daniel Boissonnat, Sylvain Lazard

Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996

Convex Hulls of Bounded Curvature.

Jean-Daniel Boissonnat, Sylvain Lazard

Proceedings of the 8th Canadian Conference on Computational Geometry, 1996

1994

From Spider Robots to Half Disk Robots.

Jean-Daniel Boissonnat, Olivier Devillers, Sylvain Lazard

Proceedings of the 1994 International Conference on Robotics and Automation, 1994