Skip to Main content Skip to Navigation


...
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-00108058v1  Conference papers
Siu-Wing ChengOtfried CheongHazel EverettRene van Oostrum. Hierarchical Vertical Decompositions, Ray Shooting, and Circular Arc Queries in Simple Polygons
ACM Symposium on Computational Geometry, Association for Computing Machinery, 1999, Miami Beach, Florida, USA, pp.227-236
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-00099260v1  Reports
Hazel EverettC.T. HoangK. KilakosM. Noy. Distance segment visibility graphs
[Intern report] A00-R-429 || everett00b, 2000
inria-00099259v1  Journal articles
Hazel EverettC.T. HoangK. KilakosM. Noy. Planar segment visibility graphs
Computational Geometry, Elsevier, 2000, 16 (4), pp.235-243
...
inria-00099245v1  Book sections
Hafsa DeddiHazel EverettSylvain Lazard. Interpolation problem with curvature constraints
A. Cohen, C. Rabut & L. L. Schumaker. Curve & Surface Fitting, Vanderbilt University press, 2000
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-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-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-00099529v1  Journal articles
Prosenjit BoseHazel EverettSteve Wismath. Properties of Arrangements Graphs
International Journal of Computational Geometry and Applications, World Scientific Publishing, 2003, 13 (6), pp.447-462
...
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-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-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-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⟩
...
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-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-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-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-00103952v1  Conference papers
Otfried CheongHazel EverettSylvain LazardHyo-Sil KimRené Schott. Throwing stones in simple polygons
2nd International Conference on Algorithmic Aspects in Information and Management (AAIM'06), Jun 2006, Hong Kong, China, pp.185-193, ⟨10.1007/11775096_18⟩
...
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-00434090v1  Journal articles
Otfried CheongHazel EverettHyo-Sil KimSylvain LazardRené Schott. Parabola separation queries and their application to stone throwing
International Journal of Computational Geometry and Applications, World Scientific Publishing, 2007, 17 (4), pp.349-360. ⟨10.1142/S0218195907002379⟩
...
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⟩