Skip to Main content Skip to Navigation


...
hal-01366148v1  Conference papers
David BremnerOlivier DevillersMarc GlisseSylvain LazardGiuseppe Liotta et al.  Monotone Simultaneous Paths Embeddings in $\mathbb{R}^d$
24th International Symposium on Graph Drawing & Network Visualization, Sep 2016, Athens, Greece
...
hal-01529154v2  Journal articles
David BremnerOlivier DevillersMarc GlisseSylvain LazardGiuseppe Liotta et al.  Monotone Simultaneous Paths Embeddings in $\mathbb{R}^d$
Discrete Mathematics and Theoretical Computer Science, DMTCS, 2018, 20 (1), pp.1-11. ⟨10.23638/DMTCS-20-1-1⟩
...
inria-00100887v1  Journal articles
Pankaj K. AgarwalThérèse BiedlSylvain LazardSteve RobbinsSubhash Suri et al.  Curvature-Constrained Shortest Paths in a Convex Polygon
SIAM Journal on Computing, Society for Industrial and Applied Mathematics, 2002, 31 (6), pp.1814-1851. ⟨10.1137/S0097539700374550⟩
...
inria-00099479v1  Conference papers
Hervé BronnimannHazel EverettSylvain LazardFrank SottileSue Whitesides. Transversals to Line Segments in R3
15th Canadian Conference on Computational Geometry - CCCG'2003, 2003, Halifax, Canada, 4 p
...
inria-00442788v1  Conference papers
Hazel EverettSylvain LazardSteve RobbinsH. SchröderSue Whitesides. Convexifying Star-Shaped Polygons
10th Canadian Conference on Computational Geometry (CCCG'98), 1998, Montreal, Canada. pp.10-12
...
inria-00099449v1  Conference papers
Hervé BrönnimannOlivier DevillersVida DujmovicHazel EverettMarc Glisse et al.  On the Number of Lines Tangent to Four Convex Polyhedra
14th Canadian Conference on Computational Geometry - CCCG'02, 2002, Lethbridge, Canada
...
inria-00192927v1  Journal articles
Olivier DevillersVida DujmovicHazel EverettSamuel HornusSue Whitesides et al.  Maintaining Visibility Information of Planar Point Sets with a Moving Viewpoint
International Journal of Computational Geometry and Applications, World Scientific Publishing, 2007, 17 (4), pp.297-304. ⟨10.1142/S0218195907002343⟩
...
inria-00336502v1  Conference papers
Linqiao ZhangHazel EverettSylvain LazardChristophe WeibelSue Whitesides. On the Size of the 3D Visibility Skeleton: Experimental Results
16th Annual European Symposium on Algorithms - ESA 2008, Sep 2008, Karlsruhe, Germany. pp.805--816, ⟨10.1007/978-3-540-87744-8_67⟩
...
inria-00338095v1  Conference papers
Linqiao ZhangHazel EverettSylvain LazardSue Whitesides. Towards an Implementation of the 3D Visibility Skeleton
23rd Annual Symposium on Computational Geometry, Jun 2007, Gyeongju, South Korea. pp.131 - 132, ⟨10.1145/1247069.1247094⟩
inria-00100521v1  Journal articles
Thérèse BiedlErik DemaineMartin DemaineSylvain LazardAnna Lubiw et al.  Locked and Unlocked Polygonal Chains in Three Dimensions
Discrete and Computational Geometry, Springer Verlag, 2001, 26 (3), pp.269-281. ⟨10.1007/s00454-001-0038-7⟩
inria-00100889v1  Journal articles
Thérèse BiedlErik DemaineMartin DemaineSylvain LazardAnna Lubiw et al.  A Note on Reconfiguring Tree Linkages: Trees can Lock
Discrete Applied Mathematics, Elsevier, 2002, 117 (1-3), pp.293-297. ⟨10.1016/S0166-218X(01)00229-3⟩
...
inria-00000569v1  Conference papers
Olivier DevillersVida DujmovicHazel EverettSamuel HornusSteve Wismath et al.  Maintaining Visibility Information of Planar Point Sets with a Moving Viewpoint
17th Canadian Conference on Computational Geometry - CCCG'2005, Aug 2005, Windsor, Canada
...
inria-00098772v2  Conference papers
Thérèse BiedlErik DemaineMartin DemaineSylvain LazardAnna Lubiw et al.  Locked and Unlocked Polygonal Chains in Three Dimensions
Symposium on Discrete Algorithms - SODA'99, Jan 1999, Baltimore, United States. pp.866 - 867
...
inria-00511233v1  Journal articles
Sylvain LazardChristophe WeibelSue WhitesidesLinqiao Zhang. A Succinct 3D Visibility Skeleton
Discrete Mathematics, Algorithms and Applications, World Scientific Publishing, 2010, 2 (4), pp.1-23. ⟨10.1142/S1793830910000899⟩
...
inria-00103995v1  Conference papers
Hervé BrönnimannOlivier DevillersVida DujmovicHazel EverettMarc Glisse et al.  The Number of Lines Tangent to Arbitrary Convex Polyhedra in 3D
Proceedings of the 20th Annual Symposium on Computational Geometry, Jun 2004, Brooklyn, NY, United States. pp.46 - 55, ⟨10.1145/997817.997827⟩
...
inria-00103916v1  Journal articles
Hervé BrönnimannOlivier DevillersVida DujmovicHazel EverettMarc Glisse et al.  Lines and free line segments Tangent to Arbitrary Three-dimensional Convex Polyhedra
SIAM Journal on Computing, Society for Industrial and Applied Mathematics, 2007, 37 (2), pp.522-551. ⟨10.1137/S0097539705447116⟩
...
hal-00827890v1  Conference papers
Pankaj K. AgarwalThérèse BiedlSylvain LazardSteve RobbinsSubhash Suri et al.  Curvature-Constrained Shortest Paths in a Convex Polygon
Symposium on Computational Geometry - SCG 1998, Jun 1998, Mineapolis, United States. pp.392-401, ⟨10.1145/276884.276928⟩
...
inria-00472839v1  Conference papers
Sylvain LazardChristophe WeibelSue WhitesidesLinqiao Zhang. On the Computation of the 3D Visibility Skeleton
16th Annual International Computing and Combinatorics Conference - COCOON 2010, Jul 2010, Nha Trang, Vietnam
...
inria-00000384v1  Journal articles
Hervé BrönnimannHazel EverettSylvain LazardFrank SottileSue Whitesides. Transversals to line segments in three-dimensional space
Discrete and Computational Geometry, Springer Verlag, 2005, 34 (3), pp.381 - 390. ⟨10.1007/s00454-005-1183-1⟩
hal-01326779v1  Conference papers
David EppsteinPhilipp KindermannStephen KobourovGiuseppe LiottaAnna Lubiw et al.  On the Planar Split Thickness of Graphs
LATIN 2016: Theoretical Informatics: 12th Latin American Symposium, Apr 2016, Ensenada, Mexico. pp.403-415, ⟨10.1007/978-3-662-49529-2_30⟩