S. Lazard

发表

A note on reconfiguring tree linkages: trees can lock

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

Towards the Robust Intersection of Implicit Quadrics

S. Petitjean, S. Lazard, L. Dupont, 2002 .

Interpolation with Curvature Constraints

H. Everett, S. Lazard, Hafsa Deddi, 2000 .

C G ] 2 9 Se p 20 00 On Reconfiguring Tree Linkages : Trees can Lock

Steve, J. O'Rourke, G. Toussaint, 2019 .

Msn-support Help

J. O'Rourke, G. Toussaint, E. Demaine, 2001 .

C G ] 8 O ct 1 99 9 Locked and Unlocked Polygonal Chains in 3 D ∗ T . Biedl

J. O'Rourke, G. Toussaint, E. Demaine, 2008 .

Fast algorithm for the visualization of surfaces

S. Lazard, M. Pouget, G. Moroz, 2019 .

the degree of standard

H. Everett, M. Glisse, S. Lazard, 2022 .

New Results - Exact geometric computing for low-degree surfaces

Hazel Everett, Sylvain Lazard, Sylvain Petitjean, 2006 .

On the theoretical complexity of the silhouette of a polyhedron

M. Glisse, S. Lazard, 2003 .

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

M. Glisse, S. Lazard, 2008 .

A Polynomial-Time Algorithm for Computing a Shortest Path of Bounded Curvature Amidst Moderate Obstacles

J. Boissonnat, S. Lazard, 2020 .

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

J. Boissonnat, S. Lazard, 1996, SCG '96.

A polynomial-time algorithm for computing a shortest path ofbounded curvature amidst moderate obstaclesJean -

J. Boissonnat, S. Lazard, 1996 .

On tangents to quadric surfaces

Ciprian S. Borcea, S. Petitjean, S. Lazard, 2004, math/0402394.

Homotopic Fréchet Distance Between Curves

S. Lazard, Shripad Thite, E. Chambers, 2012 .

Line tangents to four triangles in three-dimensional space

S. Lazard, O. Devillers, F. Sottile, 2005, math/0502564.

2 7 Fe b 20 05 LINE TANGENTS TO FOUR TRIANGLES IN THREE-DIMENSIONAL SPACE

S. Lazard, O. Devillers, Hervé Brönnimann, 2004 .

Analysis of farthest point sampling for approximating geodesics in a graph

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

On the Topology of Real Algebraic Plane Curves

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

Univariate Algebraic Kernel and Application to Arrangements

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

On the topology of planar algebraic curves

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

A CGAL-based Univariate Algebraic Kernel and Application to Arrangements

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

Intersecting quadrics: an efficient and exact implementation

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

Near-optimal parameterization of the intersection of quadrics

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

The Voronoi diagram of three arbitrary lines in R3

Hazel Everett, Sylvain Lazard, Marc Pouget, 2009 .

The Voronoi Diagram of Three Lines

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

The Voronoi diagram of three lines in R3

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

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

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

Transversals to Line Segments in Three-Dimensional Space

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

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

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

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

Sylvain Lazard, Guillaume Moroz, Marc Pouget, 2020 .

Curvature-Constrained Shortest Paths in a Convex Polygon

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

Bivariate triangular decompositions in the presence of asymptotes

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

Solving bivariate systems using Rational Univariate Representations

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

Separating linear forms and Rational Univariate Representations of bivariate systems

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

Improved algorithm for computing separating linear forms for bivariate systems

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

Variable-width contouring for additive manufacturing

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

Improved algorithms for solving bivariate systems via Rational Univariate Representations

Fabrice Rouillier, Sylvain Lazard, Guillaume Moroz, 2015 .

Separating linear forms for bivariate systems

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

Rational univariate representations of bivariate systems and applications

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

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

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

Walking your dog in the woods in polynomial time

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

Separating linear forms for bivariate systems

F. Rouillier, S. Lazard, M. Pouget, 2013, ISSAC '13.

On the Edge-Length Ratio of Outerplanar Graphs pdf

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

Universal Point Sets for Drawing Planar Graphs with Circular Arcs

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

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..

On reconfiguring tree linkages: Trees can lock

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

Convexifying star-shaped polygons

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

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..

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

Éric Colin de Verdière, S. Lazard, Shripad Thite, 2010, Comput. Geom..

The virtual mesh: a geometric abstraction for efficiently computing radiosity

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

Throwing Stones Inside Simple Polygons

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

Convexifying Monotone Polygons

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

Locked and unlocked polygonal chains in 3D

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

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

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

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

S. Lazard, L. Dupont, D. Lazard, 2008, J. Symb. Comput..

The Voronoi Diagram of Three Lines

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

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

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

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

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

Common Tangents to Spheres in ℝ3

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

Near-optimal parameterization of the intersection of quadrics

S. Lazard, L. Dupont, D. Lazard, 2003, SCG '03.

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

Sylvain Lazard, Daniel Lazard, Laurent Dupont, 2005 .

Effective Geometric Algorithms for Visibility and Surfaces

Elias P. Tsigaridas, Julien Demouth, H. Everett, 2006 .

Near-Optimal Parameterization of the Intersection of Quadrics : IV . An Efficient and Exact Implementation Sylvain Lazard —

S. Lazard, L. Peñaranda, Sylvain Petitjean, 2005 .

Near-Optimal Parameterization of the Intersection of Quadrics: IV. An Efficient and Exact Implementation

S. Lazard, L. Peñaranda, Sylvain Petitjean, 2005 .

Near-Optimal Parameterization of the Intersection of Quadrics: Theory and Implementation

S. Lazard, L. Dupont, D. Lazard, 2004 .

Between umbra and penumbra

Julien Demouth, R. Seidel, H. Everett, 2007, SCG '07.

Farthest-polygon Voronoi diagrams

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

Recognizing shrinkable complexes is NP-complete

M. Glisse, S. Lazard, D. Attali, 2014, J. Comput. Geom..

On the Expected Size of the 2D Visibility Complex

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

Predicates for Line Transversals in 3D

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