Sylvain Lazard

发表

Parabola Separation Queries and their Application to Stone Throwing

Hazel Everett, Otfried Cheong, Hyo-Sil Kim, 2007, Int. J. Comput. Geom. Appl..

Solving bivariate systems using Rational Univariate Representations

Fabrice Rouillier, Sylvain Lazard, Guillaume Moroz, 2016, J. Complex..

On the Topology of Real Algebraic Plane Curves

Fabrice Rouillier, Sylvain Lazard, Marc Pouget, 2010, Math. Comput. Sci..

On the edge-length ratio of outerplanar graphs

Giuseppe Liotta, Sylvain Lazard, William J. Lenhart, 2019, Theor. Comput. Sci..

Motion Planning of Legged Robots

Jean-Daniel Boissonnat, Sylvain Lazard, Olivier Devillers, 2000, SIAM J. Comput..

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

Sylvain Lazard, Marc Glisse, 2012, Discret. Comput. Geom..

A polynomial-time algorithm for computing a shortest path of bounded curvature amidst moderate obstacles (extended abstract)

Jean-Daniel Boissonnat, Sylvain Lazard, 1996, SCG '96.

On the topology of planar algebraic curves

Fabrice Rouillier, Sylvain Lazard, Marc Pouget, 2008, SCG '09.

Drawing Kn in Three Dimensions with One Bend Per Edge

Hazel Everett, Sylvain Lazard, Stephen K. Wismath, 2005, Graph Drawing.

From spider robots to half disk robots

Jean-Daniel Boissonnat, Sylvain Lazard, Olivier Devillers, 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

On Point-Sets That Support Planar Graphs

Giuseppe Liotta, Sylvain Lazard, Stephen K. Wismath, 2011, Graph Drawing.

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

Sylvain Lazard, Daniel Lazard, Laurent Dupont, 2008, J. Symb. Comput..

Farthest-Polygon Voronoi Diagrams

Hazel Everett, Joachim Gudmundsson, Otfried Cheong, 2007, ESA.

Convexifying Monotone Polygons

Erik D. Demaine, Sylvain Lazard, Steven M. Robbins, 1999, ISAAC.

Isolating the singularities of the plane projection of a generic space curve

Sylvain Lazard, Guillaume Moroz, Marc Pouget, 2020 .

Lines Tangent to Four Triangles in Three-Dimensional Space

Frank Sottile, Sylvain Lazard, Olivier Devillers, 2007, Discret. Comput. Geom..

Improved algorithm for computing separating linear forms for bivariate systems

Fabrice Rouillier, Sylvain Lazard, Guillaume Moroz, 2014, ISSAC.

Recognizing Shrinkable Complexes Is NP-Complete

Sylvain Lazard, Olivier Devillers, Marc Glisse, 2014, ESA.

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

Erin W. Chambers, Sylvain Lazard, Jeff Erickson, 2010, Comput. Geom..

Locked and unlocked polygonal chains in 3D

Erik D. Demaine, Godfried T. Toussaint, Sylvain Lazard, 1998, SODA '99.

Convex Hulls of Bounded Curvature

Jean-Daniel Boissonnat, Sylvain Lazard, 1996, CCCG.

Rational univariate representations of bivariate systems and applications

Fabrice Rouillier, Sylvain Lazard, Yacine Bouzidi, 2013, ISSAC '13.

On point-sets that support planar graphs

Giuseppe Liotta, Sylvain Lazard, Stephen K. Wismath, 2013, Comput. Geom..

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

Sylvain Lazard, Daniel Lazard, Laurent Dupont, 2008, J. Symb. Comput..

An Algorithm for Computing a Convex and Simple Path of Bounded Curvature in a Simple Polygon

Jean-Daniel Boissonnat, Sylvain Lazard, Telikepalli Kavitha, 2002, Algorithmica.

Intersecting quadrics: an efficient and exact implementation

Sylvain Lazard, Luis Mariano Peñaranda, Sylvain Petitjean, 2006, Comput. Geom..

The Voronoi Diagram of Three Lines

Hazel Everett, Sylvain Lazard, Mohab Safey El Din, 2007, SCG '07.

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

Hazel Everett, Xavier Goaoc, Sylvain Lazard, 2004, SCG '04.

Monotone Simultaneous Paths Embeddings in ℝd

Sylvain Lazard, Olivier Devillers, Marc Glisse, 2018, Discret. Math. Theor. Comput. Sci..

Monotone Simultaneous Embeddings of Paths in d Dimensions

Giuseppe Liotta, Sylvain Lazard, Stephen K. Wismath, 2016, Graph Drawing.

An Upper Bound on the Average Size of Silhouettes

Sylvain Lazard, Marc Glisse, 2008, Discret. Comput. Geom..

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

Giuseppe Liotta, Sylvain Lazard, William J. Lenhart, 2020, Theor. Comput. Sci..

Recognizing shrinkable complexes is NP-complete

Sylvain Lazard, Olivier Devillers, Marc Glisse, 2016, J. Comput. Geom..

On the complexity of umbra and penumbra

Hazel Everett, Sylvain Lazard, Raimund Seidel, 2009, Comput. Geom..

Near-Optimal Parameterization of the Intersection of Quadrics : III . Parameterizing Singular Intersections

Sylvain Lazard, Daniel Lazard, Laurent Dupont, 2005 .

Monotone Simultaneous Paths Embeddings in $\mathbb{R}^d$

Giuseppe Liotta, Sylvain Lazard, Stephen K. Wismath, 2016, GD 2016.

Universal Point Sets for Planar Graph Drawings with Circular Arcs

Alexander Wolff, David Eppstein, Michael Kaufmann, 2013, CCCG.

Convexifying star-shaped polygons

Hazel Everett, Sylvain Lazard, Sue Whitesides, 1998, CCCG.

On the Expected Size of the 2D Visibility Complex

Hazel Everett, Sylvain Lazard, Sylvain Petitjean, 2007, Int. J. Comput. Geom. Appl..

Separating linear forms and Rational Univariate Representations of bivariate systems

Fabrice Rouillier, Sylvain Lazard, Yacine Bouzidi, 2015, J. Symb. Comput..

Univariate Algebraic Kernel and Application to Arrangements

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

On the number of lines tangent to four convex polyhedra

Hazel Everett, Xavier Goaoc, Sylvain Lazard, 2002, CCCG.

On the Computation of 3D Visibility Skeletons

Sylvain Lazard, Sue Whitesides, Christophe Weibel, 2010, COCOON.

Silhouette of a random polytope

Sylvain Lazard, Marc Glisse, Julien Michel, 2016, J. Comput. Geom..

Curvature-Constrained Shortest Paths in a Convex Polygon

Subhash Suri, Sylvain Lazard, Pankaj K. Agarwal, 2002, SIAM J. Comput..

Between umbra and penumbra

Hazel Everett, Sylvain Lazard, Raimund Seidel, 2007, SCG '07.

On the Edge-Length Ratio of Outerplanar Graphs pdf

Giuseppe Liotta, Sylvain Lazard, William J. Lenhart, 2017, GD.

Intersecting quadrics: an efficient and exact implementation

Sylvain Lazard, Luis Mariano Peñaranda, Sylvain Petitjean, 2004, SCG '04.

The virtual mesh: a geometric abstraction for efficiently computing radiosity

Sylvain Lazard, Jean-Claude Paul, Laurent Alonso, 2001, TOGS.

Curvature-constrained shortest paths in a convex polygon (extended abstract)

Subhash Suri, Sylvain Lazard, Pankaj K. Agarwal, 1998, SCG '98.

3D Snap Rounding

Sylvain Lazard, Olivier Devillers, William J. Lenhart, 2018, Symposium on Computational Geometry.

Monotone Simultaneous Embeddings of Paths in R^d pdf

Giuseppe Liotta, Sylvain Lazard, Stephen K. Wismath, 2016, ArXiv.

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

Sylvain Lazard, Olivier Devillers, Marc Glisse, 2008, SCG '08.

Drawing Kn in Three Dimensions with One Bend per Edge

Hazel Everett, Sylvain Lazard, Stephen K. Wismath, 2006, J. Graph Algorithms Appl..

Farthest-polygon Voronoi diagrams

Hazel Everett, Joachim Gudmundsson, Otfried Cheong, 2007, Comput. Geom..

The Expected Number of 3D Visibility Events Is Linear

Hazel Everett, Xavier Goaoc, Sylvain Lazard, 2003, SIAM J. Comput..

Analysis of farthest point sampling for approximating geodesics in a graph

Sylvain Lazard, Anil Maheshwari, Pegah Kamousi, 2013, Comput. Geom..

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

Hazel Everett, Xavier Goaoc, Sylvain Lazard, 2007, SIAM J. Comput..

New Results - Exact geometric computing for low-degree surfaces

Hazel Everett, Sylvain Lazard, Sylvain Petitjean, 2006 .

New Results - Effective 3D global visibility, theory and applications

Hazel Everett, Xavier Goaoc, Sylvain Lazard, 2006 .

Universal Sets of n Points for One-bend Drawings of Planar Graphs with n Vertices

Hazel Everett, Giuseppe Liotta, Sylvain Lazard, 2010, Discret. Comput. Geom..

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

Fabrice Rouillier, Sylvain Lazard, Yacine Bouzidi, 2013, ArXiv.

Walking your dog in the woods in polynomial time

Erin W. Chambers, Sylvain Lazard, Jeff Erickson, 2008, SCG '08.

The Voronoi Diagram of Three Lines

Hazel Everett, Sylvain Lazard, Mohab Safey El Din, 2007, SCG '07.

A note on reconfiguring tree linkages: trees can lock

Erik D. Demaine, Godfried T. Toussaint, Sylvain Lazard, 2002, Discrete Applied Mathematics.

Predicates for Line Transversals in 3D

Hazel Everett, Sylvain Lazard, William J. Lenhart, 2006, CCCG.

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

Jean-Daniel Boissonnat, Sylvain Lazard, 2003, Int. J. Comput. Geom. Appl..

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

Frank Sottile, Sylvain Lazard, Olivier Devillers, 2004, CCCG.

Bivariate triangular decompositions in the presence of asymptotes

Fabrice Rouillier, Sylvain Lazard, Marc Pouget, 2017, J. Symb. Comput..

Throwing Stones Inside Simple Polygons

Hazel Everett, Otfried Cheong, Hyo-Sil Kim, 2006, AAIM.

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

Sylvain Lazard, 1996 .

Variable-width contouring for additive manufacturing

Sylvain Lefebvre, Sylvain Lazard, Marc Glisse, 2020, ACM Trans. Graph..

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

Hazel Everett, Sylvain Lazard, William J. Lenhart, 2009, Comput. Geom..

Towards an implementation of the 3D visibility skeleton

Hazel Everett, Sylvain Lazard, Sue Whitesides, 2007, SCG '07.

Universal Point Sets for Drawing Planar Graphs with Circular Arcs

Alexander Wolff, David Eppstein, Michael Kaufmann, 2013, J. Graph Algorithms Appl..

On reconfiguring tree linkages: Trees can lock

Erik D. Demaine, Godfried T. Toussaint, Sylvain Lazard, 1999, CCCG.

A Succinct 3D Visibility Skeleton

Sylvain Lazard, Sue Whitesides, Christophe Weibel, 2010, Discret. Math. Algorithms Appl..

Universal Sets of n Points for 1-Bend Drawings of Planar Graphs with n Vertices

Hazel Everett, Giuseppe Liotta, Sylvain Lazard, 2007, Graph Drawing.

Special Issue on the 24th European Workshop on Computational Geometry (EuroCG'08)

Sylvain Lazard, 2010 .

Foreword

Laureano González-Vega, Sylvain Lazard, L. González-Vega, 2010, Math. Comput. Sci..

An Experimental Assessment of the 2D Visibility Complex

Hazel Everett, Sylvain Lazard, Sylvain Petitjean, 2005, CCCG.

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

Xavier Goaoc, Hyo-Sil Kim, Sylvain Lazard, 2013, SIAM J. Comput..

Transversals to Line Segments in Three-Dimensional Space

Hazel Everett, Frank Sottile, Sylvain Lazard, 2005, Discret. Comput. Geom..

Separating linear forms for bivariate systems

Fabrice Rouillier, Sylvain Lazard, Yacine Bouzidi, 2013, ISSAC '13.

On the complexity of sets of free lines and line segments among balls in three dimensions

Sylvain Lazard, Marc Glisse, 2010, SoCG '10.

The number of transversals to line segments in R^3

Hazel Everett, Frank Sottile, Sylvain Lazard, 2003, ArXiv.

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

Hazel Everett, Sylvain Lazard, Sue Whitesides, 2008, ESA.

Locked and Unlocked Polygonal Chains in Three Dimensions

Erik D. Demaine, Godfried T. Toussaint, Sylvain Lazard, 2001, Discret. Comput. Geom..

Common Tangents to Spheres in ℝ3

Xavier Goaoc, Sylvain Lazard, Ciprian Borcea, 2006, Discret. Comput. Geom..

Transversals to line segments in R3

Hazel Everett, Frank Sottile, Sylvain Lazard, 2003, CCCG.

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, Sylvain Lazard, 2007 .

Rounding Meshes in 3D

Sylvain Lazard, Olivier Devillers, William Lenhart, 2020, Discret. Comput. Geom..

Near-optimal parameterization of the intersection of quadrics

Sylvain Lazard, Daniel Lazard, Laurent Dupont, 2003, SCG '03.

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

Sylvain Lazard, Guillaume Moroz, Marc Pouget, 2021, J. Comput. Appl. Math..

The Voronoi diagram of three arbitrary lines in R3

Hazel Everett, Sylvain Lazard, Marc Pouget, 2009 .

On the Number of Maximal Free Line Segments Tangent to Arbitrary Three-dimensional Convex Polyhedra

Hazel Everett, Xavier Goaoc, Sylvain Lazard, 2005 .

A CGAL-based Univariate Algebraic Kernel and Application to Arrangements

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

On tangents to quadric surfaces

Xavier Goaoc, Sylvain Lazard, Ciprian Borcea, 2004 .

Interpolation problem with curvature constraints

Hazel Everett, Sylvain Lazard, Hafsa Deddi, 2000 .

The Voronoi diagram of three lines in R3

Hazel Everett, Sylvain Lazard, Mohab Safey El Din, 2006 .

New bivariate system solver and topology of algebraic curves

Fabrice Rouillier, Sylvain Lazard, Yacine Bouzidi, 2011 .

Improved algorithms for solving bivariate systems via Rational Univariate Representations

Fabrice Rouillier, Sylvain Lazard, Guillaume Moroz, 2015 .

Universal Point Sets for Drawing Planar Graphs with Circular Arcs

Alexander Wolff, David Eppstein, Michael Kaufmann, 2014 .