| 2009 | ||
|---|---|---|
| 55 | Sylvain Lazard, Luis Mariano Peñaranda, Elias P. Tsigaridas: Univariate Algebraic Kernel and Application to Arrangements. SEA 2009: 209-220 | |
| 54 | Jinsan Cheng, Sylvain Lazard, Luis Mariano Peñaranda, Marc Pouget, Fabrice Rouillier, Elias P. Tsigaridas: On the topology of planar algebraic curves. Symposium on Computational Geometry 2009: 361-370 | |
| 53 | Hazel Everett, Daniel Lazard, Sylvain Lazard, Mohab Safey El Din: The Voronoi Diagram of Three Lines. Discrete & Computational Geometry 42(1): 94-130 (2009) | |
| 2008 | ||
| 52 | Linqiao Zhang, Hazel Everett, Sylvain Lazard, Christophe Weibel, Sue Whitesides: On the Size of the 3D Visibility Skeleton: Experimental Results. ESA 2008: 805-816 | |
| 51 | Erin W. Chambers, Éric Colin de Verdière, Jeff Erickson, Sylvain Lazard, Francis Lazarus, Shripad Thite: Walking your dog in the woods in polynomial time. Symposium on Computational Geometry 2008: 101-109 | |
| 50 | Olivier Devillers, Marc Glisse, Sylvain Lazard: Predicates for line transversals to lines and line segments in three-dimensional space. Symposium on Computational Geometry 2008: 174-181 | |
| 49 | Marc Glisse, Sylvain Lazard: An Upper Bound on the Average Size of Silhouettes. Discrete & Computational Geometry 40(2): 241-257 (2008) | |
| 48 | Laurent Dupont, Daniel Lazard, Sylvain Lazard, Sylvain Petitjean: Near-optimal parameterization of the intersection of quadrics: I. The generic algorithm. J. Symb. Comput. 43(3): 168-191 (2008) | |
| 47 | Laurent Dupont, Daniel Lazard, Sylvain Lazard, Sylvain Petitjean: Near-optimal parameterization of the intersection of quadrics: II. A classification of pencils. J. Symb. Comput. 43(3): 192-215 (2008) | |
| 46 | Laurent Dupont, Daniel Lazard, Sylvain Lazard, Sylvain Petitjean: Near-optimal parameterization of the intersection of quadrics: III. Parameterizing singular intersections. J. Symb. Comput. 43(3): 216-232 (2008) | |
| 2007 | ||
| 45 | Otfried Cheong, Hazel Everett, Marc Glisse, Joachim Gudmundsson, Samuel Hornus, Sylvain Lazard, Mira Lee, Hyeon-Suk Na: Farthest-Polygon Voronoi Diagrams. ESA 2007: 407-418 | |
| 44 | Hazel Everett, Sylvain Lazard, Giuseppe Liotta, Stephen K. Wismath: Universal Sets of n Points for 1-Bend Drawings of Planar Graphs with n Vertices. Graph Drawing 2007: 345-351 | |
| 43 | Linqiao Zhang, Hazel Everett, Sylvain Lazard, Sue Whitesides: Towards an implementation of the 3D visibility skeleton. Symposium on Computational Geometry 2007: 131-132 | |
| 42 | Hazel Everett, Sylvain Lazard, Daniel Lazard, Mohab Safey El Din: The voronoi diagram of three lines. Symposium on Computational Geometry 2007: 255-264 | |
| 41 | Julien Demouth, Olivier Devillers, Hazel Everett, Marc Glisse, Sylvain Lazard, Raimund Seidel: Between umbra and penumbra. Symposium on Computational Geometry 2007: 265-274 | |
| 40 | Marc Glisse, Sylvain Lazard: An Upper Bound on the Average Size of Silhouettes CoRR abs/cs/0702087: (2007) | |
| 39 | Hervé Brönnimann, Olivier Devillers, Sylvain Lazard, Frank Sottile: Lines Tangent to Four Triangles in Three-Dimensional Space. Discrete & Computational Geometry 37(3): 369-380 (2007) | |
| 38 | Otfried Cheong, Hazel Everett, Hyo-Sil Kim, Sylvain Lazard, René Schott: Parabola Separation Queries and their Application to Stone Throwing. Int. J. Comput. Geometry Appl. 17(4): 349-360 (2007) | |
| 37 | Hazel Everett, Sylvain Lazard, Sylvain Petitjean, Linqiao Zhang: On the Expected Size of the 2D Visibility Complex. Int. J. Comput. Geometry Appl. 17(4): 361-381 (2007) | |
| 36 | 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. SIAM J. Comput. 37(2): 522-551 (2007) | |
| 2006 | ||
| 35 | Otfried Cheong, Hazel Everett, Hyo-Sil Kim, Sylvain Lazard, René Schott: Throwing Stones Inside Simple Polygons . AAIM 2006: 185-193 | |
| 34 | Hazel Everett, Sylvain Lazard, William J. Lenhart, Jeremy Redburn, Linqiao Zhang: Predicates for Line Transversals in 3D. CCCG 2006 | |
| 33 | Sylvain Lazard, Luis Mariano Peñaranda, Sylvain Petitjean: Intersecting quadrics: an efficient and exact implementation. Comput. Geom. 35(1-2): 74-99 (2006) | |
| 32 | Ciprian Borcea, Xavier Goaoc, Sylvain Lazard, Sylvain Petitjean: Common Tangents to Spheres in R3. Discrete & Computational Geometry 35(2): 287-300 (2006) | |
| 31 | Olivier Devillers, Hazel Everett, Sylvain Lazard, Maria Pentcheva, Stephen K. Wismath: Drawing Kn in Three Dimensions with One Bend per Edge. J. Graph Algorithms Appl. 10(2): 287-295 (2006) | |
| 2005 | ||
| 30 | Hazel Everett, Sylvain Lazard, Sylvain Petitjean, Linqiao Zhang: An Experimental Assessment of the 2D Visibility Complex. CCCG 2005: 298-301 | |
| 29 | Olivier Devillers, Hazel Everett, Sylvain Lazard, Maria Pentcheva, Stephen K. Wismath: Drawing Kn in Three Dimensions with One Bend Per Edge. Graph Drawing 2005: 83-88 | |
| 28 | Hervé Brönnimann, Hazel Everett, Sylvain Lazard, Frank Sottile, Sue Whitesides: Transversals to Line Segments in Three-Dimensional Space. Discrete & Computational Geometry 34(3): 381-390 (2005) | |
| 2004 | ||
| 27 | Hervé Brönnimann, Olivier Devillers, Sylvain Lazard, Frank Sottile: On the number of line tangents to four triangles in three-dimensional space. CCCG 2004: 184-187 | |
| 26 | Sylvain Lazard, Luis Mariano Peñaranda, Sylvain Petitjean: Intersecting quadrics: an efficient and exact implementation. Symposium on Computational Geometry 2004: 419-428 | |
| 25 | 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. Symposium on Computational Geometry 2004: 46-55 | |
| 2003 | ||
| 24 | Hervé Brönnimann, Hazel Everett, Sylvain Lazard, Frank Sottile, Sue Whitesides: Transversals to line segments in R3. CCCG 2003: 174-177 | |
| 23 | Laurent Dupont, Daniel Lazard, Sylvain Lazard, Sylvain Petitjean: Near-optimal parameterization of the intersection of quadrics. Symposium on Computational Geometry 2003: 246-255 | |
| 22 | Hervé Brönnimann, Hazel Everett, Sylvain Lazard, Frank Sottile, Sue Whitesides: The number of transversals to line segments in R^3 CoRR math.MG/0306401: (2003) | |
| 21 | Jean-Daniel Boissonnat, Sylvain Lazard: A Polynomial-Time Algorithm for Computing Shortest Paths of Bounded Curvature AmidstModerate Obstacles. Int. J. Comput. Geometry Appl. 13(3): 189-229 (2003) | |
| 20 | Olivier Devillers, Vida Dujmovic, Hazel Everett, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sylvain Petitjean: The Expected Number of 3D Visibility Events Is Linear. SIAM J. Comput. 32(6): 1586-1620 (2003) | |
| 2002 | ||
| 19 | 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. CCCG 2002: 113-117 | |
| 18 | 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. Algorithmica 34(2): 109-156 (2002) | |
| 17 | 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. Discrete Applied Mathematics 117(1-3): 293-297 (2002) | |
| 16 | Pankaj K. Agarwal, Therese C. Biedl, Sylvain Lazard, Steve Robbins, Subhash Suri, Sue Whitesides: Curvature-Constrained Shortest Paths in a Convex Polygon. SIAM J. Comput. 31(6): 1814-1851 (2002) | |
| 2001 | ||
| 15 | Laurent Alonso, François Cuny, Sylvain Petitjean, Jean-Claude Paul, Sylvain Lazard, Eric Wies: The virtual mesh: a geometric abstraction for efficiently computing radiosity. ACM Trans. Graph. 20(3): 169-201 (2001) | |
| 14 | 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. Discrete & Computational Geometry 26(3): 269-281 (2001) | |
| 2000 | ||
| 13 | Jean-Daniel Boissonnat, Olivier Devillers, Sylvain Lazard: Motion Planning of Legged Robots. SIAM J. Comput. 30(1): 218-246 (2000) | |
| 1999 | ||
| 12 | Therese C. Biedl, Erik D. Demaine, Sylvain Lazard, Steven M. Robbins, Michael A. Soss: Convexifying Monotone Polygons. ISAAC 1999: 415-424 | |
| 11 | 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. SODA 1999: 866-867 | |
| 10 | Jean-Daniel Boissonnat, Olivier Devillers, Sylvain Lazard: Motion Planning of Legged Robots CoRR cs.CG/9909006: (1999) | |
| 9 | 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 CoRR cs.CG/9910009: (1999) | |
| 8 | 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 CoRR cs.CG/9910024: (1999) | |
| 1998 | ||
| 7 | Hazel Everett, Sylvain Lazard, Steven M. Robbins, H. Schröder, Sue Whitesides: Convexifying star-shaped polygons. CCCG 1998 | |
| 6 | 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. CCCG 1998 | |
| 5 | Pankaj K. Agarwal, Therese C. Biedl, Sylvain Lazard, Steve Robbins, Subhash Suri, Sue Whitesides: Curvature-Constrained Shortest Paths in a Convex Polygon (Extended Abstract). Symposium on Computational Geometry 1998: 392-401 | |
| 4 | 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 CoRR cs.CG/9811019: (1998) | |
| 1996 | ||
| 3 | Jean-Daniel Boissonnat, Sylvain Lazard: Convex Hulls of Bounded Curvature. CCCG 1996: 14-19 | |
| 2 | Jean-Daniel Boissonnat, Sylvain Lazard: A Polynomial-Time Algorithm for Computing a Shortest Path of Bounded Curvature Amidst Moderate Obstacles (Extended Abstract). Symposium on Computational Geometry 1996: 242-251 | |
| 1994 | ||
| 1 | Jean-Daniel Boissonnat, Olivier Devillers, Sylvain Lazard: From Spider Robots to Half Disk Robots. ICRA 1994: 953-958 | |