Spremljaj
Sylvain Lazard
Sylvain Lazard
INRIA
Preverjeni e-poštni naslov na loria.fr
Naslov
Navedeno
Navedeno
Leto
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
133*2010
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
121*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
120*1998
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
1171998
A polynomial-time algorithm for computing a shortest path of bounded curvature amidst moderate obstacles
JD Boissonnat, S Lazard
Proceedings of the twelfth annual symposium on Computational geometry, 242-251, 1996
1161996
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, 269-281, 2001
1022001
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, 113-137, 2010
101*2010
Intersecting quadrics: An efficient and exact implementation
S Lazard, LM Penaranda, S Petitjean
Proceedings of the twentieth annual symposium on computational geometry, 419-428, 2004
792004
The Voronoi diagram of three lines
H Everett, S Lazard, D Lazard, MS El Din
Proceedings of the twenty-third annual symposium on Computational geometry …, 2007
772007
Farthest-polygon Voronoi diagrams
O Cheong, H Everett, M Glisse, J Gudmundsson, S Hornus, S Lazard, ...
Computational Geometry 44 (4), 234-247, 2011
72*2011
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
712002
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
612013
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
58*2007
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
482008
Motion planning of legged robots
JD Boissonnat, O Devillers, S Lazard
SIAM Journal on Computing 30 (1), 218-246, 2000
482000
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
442003
Analysis of farthest point sampling for approximating geodesics in a graph
P Kamousi, S Lazard, A Maheshwari, S Wuhrer
Computational Geometry 57, 1-7, 2016
412016
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, 272-288, 2010
41*2010
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
402008
Solving bivariate systems using rational univariate representations
Y Bouzidi, S Lazard, G Moroz, M Pouget, F Rouillier, M Sagraloff
Journal of Complexity 37, 34-75, 2016
382016
Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.
Članki 1–20