The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Sylvain Lazard: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Otfried Cheong, Hazel Everett, Hyo-Sil Kim, Sylvain Lazard, René Schott
    Throwing Stones Inside Simple Polygons . [Citation Graph (0, 0)][DBLP]
    AAIM, 2006, pp:185-193 [Conf]
  2. 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
    On reconfiguring tree linkages: Trees can lock. [Citation Graph (0, 0)][DBLP]
    CCCG, 1998, pp:- [Conf]
  3. Jean-Daniel Boissonnat, Sylvain Lazard
    Convex Hulls of Bounded Curvature. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:14-19 [Conf]
  4. Hervé Brönnimann, Olivier Devillers, Vida Dujmovic, Hazel Everett, Marc Glisse, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sue Whitesides
    On the number of lines tangent to four convex polyhedra. [Citation Graph (0, 0)][DBLP]
    CCCG, 2002, pp:113-117 [Conf]
  5. Hervé Brönnimann, Olivier Devillers, Sylvain Lazard, Frank Sottile
    On the number of line tangents to four triangles in three-dimensional space. [Citation Graph (0, 0)][DBLP]
    CCCG, 2004, pp:184-187 [Conf]
  6. Hervé Brönnimann, Hazel Everett, Sylvain Lazard, Frank Sottile, Sue Whitesides
    Transversals to line segments in R3. [Citation Graph (0, 0)][DBLP]
    CCCG, 2003, pp:174-177 [Conf]
  7. Hazel Everett, Sylvain Lazard, Sylvain Petitjean, Linqiao Zhang
    An Experimental Assessment of the 2D Visibility Complex. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:298-301 [Conf]
  8. Hazel Everett, Sylvain Lazard, Steven M. Robbins, H. Schröder, Sue Whitesides
    Convexifying star-shaped polygons. [Citation Graph (0, 0)][DBLP]
    CCCG, 1998, pp:- [Conf]
  9. Pankaj K. Agarwal, Therese C. Biedl, Sylvain Lazard, Steve Robbins, Subhash Suri, Sue Whitesides
    Curvature-Constrained Shortest Paths in a Convex Polygon (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:392-401 [Conf]
  10. Jean-Daniel Boissonnat, Sylvain Lazard
    A Polynomial-Time Algorithm for Computing a Shortest Path of Bounded Curvature Amidst Moderate Obstacles (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1996, pp:242-251 [Conf]
  11. Hervé Brönnimann, Olivier Devillers, Vida Dujmovic, Hazel Everett, Marc Glisse, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sue Whitesides
    The number of lines tangent to arbitrary convex polyhedra in 3D. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2004, pp:46-55 [Conf]
  12. Laurent Dupont, Daniel Lazard, Sylvain Lazard, Sylvain Petitjean
    Near-optimal parameterization of the intersection of quadrics. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:246-255 [Conf]
  13. Sylvain Lazard, Luis Mariano Peñaranda, Sylvain Petitjean
    Intersecting quadrics: an efficient and exact implementation. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2004, pp:419-428 [Conf]
  14. Julien Demouth, Olivier Devillers, Hazel Everett, Marc Glisse, Sylvain Lazard, Raimund Seidel
    Between umbra and penumbra. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2007, pp:265-274 [Conf]
  15. Hazel Everett, Sylvain Lazard, Daniel Lazard, Mohab Safey El Din
    The voronoi diagram of three lines. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2007, pp:255-264 [Conf]
  16. Linqiao Zhang, Hazel Everett, Sylvain Lazard, Sue Whitesides
    Towards an implementation of the 3D visibility skeleton. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2007, pp:131-132 [Conf]
  17. Olivier Devillers, Hazel Everett, Sylvain Lazard, Maria Pentcheva, Stephen K. Wismath
    Drawing Kn in Three Dimensions with One Bend Per Edge. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2005, pp:83-88 [Conf]
  18. Jean-Daniel Boissonnat, Olivier Devillers, Sylvain Lazard
    From Spider Robots to Half Disk Robots. [Citation Graph (0, 0)][DBLP]
    ICRA, 1994, pp:953-958 [Conf]
  19. Therese C. Biedl, Erik D. Demaine, Sylvain Lazard, Steven M. Robbins, Michael A. Soss
    Convexifying Monotone Polygons. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1999, pp:415-424 [Conf]
  20. 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
    Locked and Unlocked Polygonal Chains in 3D. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:866-867 [Conf]
  21. Jean-Daniel Boissonnat, Subir Kumar Ghosh, Telikepalli Kavitha, Sylvain Lazard
    An Algorithm for Computing a Convex and Simple Path of Bounded Curvature in a Simple Polygon. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:34, n:2, pp:109-156 [Journal]
  22. Sylvain Lazard, Luis Mariano Peñaranda, Sylvain Petitjean
    Intersecting quadrics: an efficient and exact implementation. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2006, v:35, n:1-2, pp:74-99 [Journal]
  23. 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
    Locked and Unlocked Polygonal Chains in 3D [Citation Graph (0, 0)][DBLP]
    CoRR, 1998, v:0, n:, pp:- [Journal]
  24. Jean-Daniel Boissonnat, Olivier Devillers, Sylvain Lazard
    Motion Planning of Legged Robots [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  25. 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
    Locked and Unlocked Polygonal Chains in 3D [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  26. 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
    On Reconfiguring Tree Linkages: Trees can Lock [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  27. Hervé Brönnimann, Hazel Everett, Sylvain Lazard, Frank Sottile, Sue Whitesides
    The number of transversals to line segments in R^3 [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  28. 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
    A note on reconfiguring tree linkages: trees can lock. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:117, n:1-3, pp:293-297 [Journal]
  29. Ciprian Borcea, Xavier Goaoc, Sylvain Lazard, Sylvain Petitjean
    Common Tangents to Spheres in R3. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2006, v:35, n:2, pp:287-300 [Journal]
  30. 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
    Locked and Unlocked Polygonal Chains in Three Dimensions. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2001, v:26, n:3, pp:269-281 [Journal]
  31. Hervé Brönnimann, Hazel Everett, Sylvain Lazard, Frank Sottile, Sue Whitesides
    Transversals to Line Segments in Three-Dimensional Space. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2005, v:34, n:3, pp:381-390 [Journal]
  32. Jean-Daniel Boissonnat, Sylvain Lazard
    A Polynomial-Time Algorithm for Computing Shortest Paths of Bounded Curvature AmidstModerate Obstacles. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2003, v:13, n:3, pp:189-229 [Journal]
  33. Pankaj K. Agarwal, Therese C. Biedl, Sylvain Lazard, Steve Robbins, Subhash Suri, Sue Whitesides
    Curvature-Constrained Shortest Paths in a Convex Polygon. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2002, v:31, n:6, pp:1814-1851 [Journal]
  34. Jean-Daniel Boissonnat, Olivier Devillers, Sylvain Lazard
    Motion Planning of Legged Robots. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:1, pp:218-246 [Journal]
  35. Olivier Devillers, Vida Dujmovic, Hazel Everett, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sylvain Petitjean
    The Expected Number of 3D Visibility Events Is Linear. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2003, v:32, n:6, pp:1586-1620 [Journal]
  36. Laurent Alonso, François Cuny, Sylvain Petitjean, Jean-Claude Paul, Sylvain Lazard, Eric Wies
    The virtual mesh: a geometric abstraction for efficiently computing radiosity. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Graph., 2001, v:20, n:3, pp:169-201 [Journal]
  37. Hazel Everett, Sylvain Lazard, William J. Lenhart, Jeremy Redburn, Linqiao Zhang
    Predicates for Line Transversals in 3D. [Citation Graph (0, 0)][DBLP]
    CCCG, 2006, pp:- [Conf]
  38. Otfried Cheong, Hazel Everett, Marc Glisse, Joachim Gudmundsson, Samuel Hornus, Sylvain Lazard, Mira Lee, Hyeon-Suk Na
    Farthest-Polygon Voronoi Diagrams. [Citation Graph (0, 0)][DBLP]
    ESA, 2007, pp:407-418 [Conf]
  39. Marc Glisse, Sylvain Lazard
    An Upper Bound on the Average Size of Silhouettes [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  40. Hervé Brönnimann, Olivier Devillers, Sylvain Lazard, Frank Sottile
    Lines Tangent to Four Triangles in Three-Dimensional Space. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2007, v:37, n:3, pp:369-380 [Journal]
  41. Hervé Brönnimann, Olivier Devillers, Vida Dujmovic, Hazel Everett, Marc Glisse, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sue Whitesides
    Lines and Free Line Segments Tangent to Arbitrary Three-Dimensional Convex Polyhedra. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:37, n:2, pp:522-551 [Journal]

  42. On the Computation of 3D Visibility Skeletons. [Citation Graph (, )][DBLP]


  43. Walking your dog in the woods in polynomial time. [Citation Graph (, )][DBLP]


  44. Predicates for line transversals to lines and line segments in three-dimensional space. [Citation Graph (, )][DBLP]


  45. On the topology of planar algebraic curves. [Citation Graph (, )][DBLP]


  46. On the complexity of sets of free lines and line segments among balls in three dimensions. [Citation Graph (, )][DBLP]


  47. On the Size of the 3D Visibility Skeleton: Experimental Results. [Citation Graph (, )][DBLP]


  48. Universal Sets of n Points for 1-Bend Drawings of Planar Graphs with n Vertices. [Citation Graph (, )][DBLP]


  49. Univariate Algebraic Kernel and Application to Arrangements. [Citation Graph (, )][DBLP]


  50. On the degree of standard geometric predicates for line transversals in 3D. [Citation Graph (, )][DBLP]


  51. On the complexity of umbra and penumbra. [Citation Graph (, )][DBLP]


  52. Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time. [Citation Graph (, )][DBLP]


  53. Editorial. [Citation Graph (, )][DBLP]


  54. Farthest-Polygon Voronoi Diagrams [Citation Graph (, )][DBLP]


  55. An Upper Bound on the Average Size of Silhouettes. [Citation Graph (, )][DBLP]


  56. The Voronoi Diagram of Three Lines. [Citation Graph (, )][DBLP]


  57. Universal Sets of n Points for One-bend Drawings of Planar Graphs with n Vertices. [Citation Graph (, )][DBLP]


Search in 0.180secs, Finished in 0.182secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002