Skip to Main content Skip to Navigation


...
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-00099260v1  Reports
Hazel EverettC.T. HoangK. KilakosM. Noy. Distance segment visibility graphs
[Intern report] A00-R-429 || everett00b, 2000
...
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-00186085v1  Conference papers
Hazel EverettDaniel LazardSylvain LazardMohab Safey El Din. The Voronoi Diagram of Three Lines
23rd Annual Symposium on Computational Geometry (SoCG'07), Hee-Kap Ahn, Otfried Cheong, and Kyung-Yong Chwa, Jun 2007, Gyeongju, South Korea. pp.255-264, ⟨10.1145/1247069.1247116⟩
...
inria-00189036v1  Conference papers
Hazel EverettSylvain LazardGiuseppe LiottaSteve Wismath. Universal Sets of n Points for 1-bend Drawings of Planar Graphs with n Vertices
The 15th International Symposium on Graph Drawing - GD 2007, Sep 2007, Sydney, Australia. pp.345-351, ⟨10.1007/978-3-540-77537-9_34⟩
...
inria-00425378v1  Conference papers
Hazel EverettChristian GillotDaniel LazardSylvain LazardMarc Pouget. The Voronoi diagram of three arbitrary lines in R3
25th European Workshop on Computational Geometry - EuroCG'09, Mar 2009, Bruxelles, Belgium. pp.297-300
...
inria-00103926v1  Journal articles
Hazel EverettSylvain LazardSylvain PetitjeanLinqiao Zhang. On the Expected Size of the 2D Visibility Complex
International Journal of Computational Geometry and Applications, World Scientific Publishing, 2007, 17 (4), pp.361-381. ⟨10.1142/S0218195907002380⟩
inria-00100553v1  Book sections
Hazel EverettCelina M. H. de FigueiredoClaudia Linhares SalesFrédéric MaffrayOscar Porto et al.  Even Pairs
Jorge L. Ramirez Alfonsin et Bruce A. Reed. Perfect Graphs, John Wiley and Sons Ltd., 23 p, 2001, Wiley-Interscience Series in Discrete Mathematics and Optimization
...
inria-00103945v1  Conference papers
Hazel EverettSylvain LazardBill LenhartJeremy RedburnLinqiao Zhang. Predicates for Line Transversals in 3D
18th Canadian Conference on Computational Geometry - CCCG 2006, Aug 2006, Kingston, Canada
...
inria-00000373v2  Conference papers
Hazel EverettSylvain LazardSylvain PetitjeanLinqiao Zhang. An Experimental Assessment of the 2D Visibility Complex
17th Canadian Conference on Computational Geometry - CCCG'2005, Aug 2005, Windsor, Canada
inria-00100577v1  Conference papers
Hazel EverettCelina de FigueiredoSulamita KleinBruce Reed. Bull-Reducible Berge Graphs are Perfect
Euroconference on Combinatorics, Graph Theory and Applications - COMB'01, 2001, Barcelone, Spain, 3 p
inria-00099259v1  Journal articles
Hazel EverettC.T. HoangK. KilakosM. Noy. Planar segment visibility graphs
Computational Geometry, Elsevier, 2000, 16 (4), pp.235-243
...
inria-00431518v1  Journal articles
Hazel EverettDaniel LazardSylvain LazardMohab Safey El Din. The Voronoi diagram of three lines
Discrete and Computational Geometry, Springer Verlag, 2009, 42 (1), pp.94-130. ⟨10.1007/s00454-009-9173-3⟩
inria-00098848v1  Journal articles
Hazel EverettFerran HurtadoMarc Noy. Stabbing information of a simple polygon
Discrete Applied Mathematics, Elsevier, 1999, 91 (1-3), pp.67-92
...
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-00103923v1  Journal articles
Olivier DevillersHazel EverettSylvain LazardMaria PentchevaSteve Wismath. Drawing Kn in Three Dimensions with One Bend per Edge
Journal of Graph Algorithms and Applications, Brown University, 2006, 10 (2), pp.287-295
...
inria-00000374v1  Conference papers
Olivier DevillersHazel EverettSylvain LazardMaria PentchevaStephen Wismath. Drawing $K_n$ in Three Dimensions with One Bend per Edge
13th International Symposium on Graph Drawing - GD'2005, Sep 2005, University of Limerick, Ireland
...
inria-00099810v1  Journal articles
Olivier DevillersVida DujmovicHazel EverettXavier GoaocSylvain Lazard et al.  The expected number of 3D visibility events is linear
SIAM Journal on Computing, Society for Industrial and Applied Mathematics, 2003, 32 (6), pp.1586-1620. ⟨10.1137/S0097539702419662⟩
...
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-00187253v1  Conference papers
Julien DemouthOlivier DevillersHazel EverettMarc GlisseSylvain Lazard et al.  Between umbra and penumbra
Proceedings of the 23rd Annual Symposium on Computational Geometry, Hee-Kap Ahn, Otfried Cheong, and Kyung-Yong Chwa, Jun 2007, Gyeongju, South Korea. pp.265-274, ⟨10.1145/1247069.1247117⟩