Sylvain Lazard
Sylvain Lazard
INRIA
Verified email at loria.fr
Title
Cited by
Cited by
Year
Near-optimal parameterization of the intersection of quadrics: I. The generic algorithm
L Dupont, D Lazard, S Lazard, S Petitjean
Journal of Symbolic Computation 43 (3), 168-191, 2008
108*2008
The complexity of the two dimensional curvature-constrained shortest-path problem
S Lazard, J Reif, H Wang
Proceedings of the Third International Workshop on the Algorithmic …, 1998
108*1998
A polynomial-time algorithm for computing shortest paths of bounded curvature amidst moderate obstacles
JD Boissonnat, S Lazard
International Journal of Computational Geometry & Applications 13 (03), 189-229, 2003
103*2003
Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time
EW Chambers, É Colin de Verdičre, J Erickson, S Lazard, F Lazarus, ...
Computational Geometry 43 (3), 295-311, 2010
99*2010
Locked and unlocked polygonal chains in three dimensions
T Biedl, E Demaine, M Demaine, S Lazard, A Lubiw, J O'Rourke, ...
Discrete & Computational Geometry 26 (3), 269-281, 2001
93*2001
On the topology of real algebraic plane curves
J Cheng, S Lazard, L Peńaranda, M Pouget, F Rouillier, E Tsigaridas
Mathematics in Computer Science 4 (1), 113-137, 2010
82*2010
Intersecting quadrics: An efficient and exact implementation
S Lazard, LM Penaranda, S Petitjean
Computational Geometry 35 (1-2), 74-99, 2006
772006
A note on reconfiguring tree linkages: Trees can lock
T Biedl, E Demaine, M Demaine, S Lazard, A Lubiw, J O'Rourke, ...
Discrete Applied Mathematics 117 (1-3), 293-297, 2002
662002
The Voronoi diagram of three lines
H Everett, D Lazard, S Lazard, MS El Din
Discrete & Computational Geometry 42 (1), 94-130, 2009
632009
Curvature-constrained shortest paths in a convex polygon
PK Agarwal, T Biedl, S Lazard, S Robbins, S Suri, S Whitesides
SIAM Journal on Computing 31 (6), 1814-1851, 2002
572002
Farthest-polygon Voronoi diagrams
O Cheong, H Everett, M Glisse, J Gudmundsson, S Hornus, S Lazard, ...
Computational Geometry 44 (4), 234-247, 2011
56*2011
Lines and free line segments tangent to arbitrary three-dimensional convex polyhedra
H Brönnimann, O Devillers, V Dujmović, H Everett, M Glisse, X Goaoc, ...
SIAM Journal on Computing 37 (2), 522-551, 2007
49*2007
Motion planning of legged robots
JD Boissonnat, O Devillers, S Lazard
SIAM Journal on Computing 30 (1), 218-246, 2000
462000
Bounded-curvature shortest paths through a sequence of points using convex optimization
X Goaoc, HS Kim, S Lazard
SIAM Journal on Computing 42 (2), 662-684, 2013
452013
Curvature-constrained shortest paths in a convex polygon
PK Agarwal, T Biedl, S Lazard, S Robbins, S Suri, S Whitesides
Proceedings of the fourteenth annual symposium on Computational geometry …, 1998
451998
Near-optimal parameterization of the intersection of quadrics: II. A classification of pencils
L Dupont, D Lazard, S Lazard, S Petitjean
Journal of Symbolic Computation 43 (3), 192-215, 2008
402008
The expected number of 3D visibility events is linear
O Devillers, V Dujmovic, H Everett, X Goaoc, S Lazard, HS Na, S Petitjean
SIAM Journal on Computing 32 (6), 1586-1620, 2003
372003
Near-optimal parameterization of the intersection of quadrics: III. Parameterizing singular intersections
L Dupont, D Lazard, S Lazard, S Petitjean
Journal of Symbolic Computation 43 (3), 216-232, 2008
352008
Transversals to line segments in three-dimensional space
H Brönnimann, H Everett, S Lazard, F Sottile, S Whitesides
Discrete & Computational Geometry 34 (3), 381-390, 2005
342005
Universal sets of n points for one-bend drawings of planar graphs with n vertices
H Everett, S Lazard, G Liotta, S Wismath
Discrete & Computational Geometry 43 (2), 272-288, 2010
33*2010
The system can't perform the operation now. Try again later.
Articles 1–20