2008 |
52 | EE | 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 | EE | 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 | EE | 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 | EE | Marc Glisse,
Sylvain Lazard:
An Upper Bound on the Average Size of Silhouettes.
Discrete & Computational Geometry 40(2): 241-257 (2008) |
48 | EE | 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 | EE | 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 | EE | 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 | EE | 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 | EE | 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 | EE | Linqiao Zhang,
Hazel Everett,
Sylvain Lazard,
Sue Whitesides:
Towards an implementation of the 3D visibility skeleton.
Symposium on Computational Geometry 2007: 131-132 |
42 | EE | Hazel Everett,
Sylvain Lazard,
Daniel Lazard,
Mohab Safey El Din:
The voronoi diagram of three lines.
Symposium on Computational Geometry 2007: 255-264 |
41 | EE | Julien Demouth,
Olivier Devillers,
Hazel Everett,
Marc Glisse,
Sylvain Lazard,
Raimund Seidel:
Between umbra and penumbra.
Symposium on Computational Geometry 2007: 265-274 |
40 | EE | Marc Glisse,
Sylvain Lazard:
An Upper Bound on the Average Size of Silhouettes
CoRR abs/cs/0702087: (2007) |
39 | EE | 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 | EE | 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 | EE | 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 | EE | 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 | EE | Otfried Cheong,
Hazel Everett,
Hyo-Sil Kim,
Sylvain Lazard,
René Schott:
Throwing Stones Inside Simple Polygons .
AAIM 2006: 185-193 |
34 | EE | Hazel Everett,
Sylvain Lazard,
William J. Lenhart,
Jeremy Redburn,
Linqiao Zhang:
Predicates for Line Transversals in 3D.
CCCG 2006 |
33 | EE | Sylvain Lazard,
Luis Mariano Peñaranda,
Sylvain Petitjean:
Intersecting quadrics: an efficient and exact implementation.
Comput. Geom. 35(1-2): 74-99 (2006) |
32 | EE | Ciprian Borcea,
Xavier Goaoc,
Sylvain Lazard,
Sylvain Petitjean:
Common Tangents to Spheres in R3.
Discrete & Computational Geometry 35(2): 287-300 (2006) |
31 | EE | 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 | EE | Hazel Everett,
Sylvain Lazard,
Sylvain Petitjean,
Linqiao Zhang:
An Experimental Assessment of the 2D Visibility Complex.
CCCG 2005: 298-301 |
29 | EE | 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 | EE | 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 | EE | 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 | EE | Sylvain Lazard,
Luis Mariano Peñaranda,
Sylvain Petitjean:
Intersecting quadrics: an efficient and exact implementation.
Symposium on Computational Geometry 2004: 419-428 |
25 | EE | 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 | EE | Laurent Dupont,
Daniel Lazard,
Sylvain Lazard,
Sylvain Petitjean:
Near-optimal parameterization of the intersection of quadrics.
Symposium on Computational Geometry 2003: 246-255 |
22 | EE | 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 | EE | 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 | EE | 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 | EE | 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 | EE | 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 | EE | 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 | EE | 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 | EE | 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 | EE | Therese C. Biedl,
Erik D. Demaine,
Sylvain Lazard,
Steven M. Robbins,
Michael A. Soss:
Convexifying Monotone Polygons.
ISAAC 1999: 415-424 |
11 | EE | 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 | EE | Jean-Daniel Boissonnat,
Olivier Devillers,
Sylvain Lazard:
Motion Planning of Legged Robots
CoRR cs.CG/9909006: (1999) |
9 | EE | 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 | EE | 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 | EE | Hazel Everett,
Sylvain Lazard,
Steven M. Robbins,
H. Schröder,
Sue Whitesides:
Convexifying star-shaped polygons.
CCCG 1998 |
6 | EE | 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 | EE | 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 | EE | 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 | EE | 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 |