HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
  1. Search


...
inria-00442788v1  Conference papers
Hazel Everett, Sylvain Lazard, Steve Robbins, H. Schröder, Sue 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 Cheng, Otfried Cheong, Hazel Everett, Rene 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 Everett, Ferran Hurtado, Marc Noy. Stabbing information of a simple polygon
Discrete Applied Mathematics, Elsevier, 1999, 91 (1-3), pp.67-92
...
inria-00072572v1  Reports
Hafsa Deddi, Hazel Everett, Sylvain Lazard. Interpolation with Curvature Constraints
[Research Report] RR-4064, INRIA. 2000
inria-00099259v1  Journal articles
Hazel Everett, C.T. Hoang, K. Kilakos, M. Noy. Planar segment visibility graphs
Computational Geometry, Elsevier, 2000, 16 (4), pp.235-243
...
inria-00099245v1  Book sections
Hafsa Deddi, Hazel Everett, Sylvain Lazard. Interpolation problem with curvature constraints
A. Cohen, C. Rabut & L. L. Schumaker. Curve & Surface Fitting, Vanderbilt University press, 2000
inria-00099260v1  Reports
Hazel Everett, C.T. Hoang, K. Kilakos, M. Noy. Distance segment visibility graphs
[Intern report] A00-R-429 || everett00b, 2000
inria-00100553v1  Book sections
Hazel Everett, Celina M. H. de Figueiredo, Claudia Linhares Sales, Frédéric Maffray, Oscar 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 Everett, Celina de Figueiredo, Sulamita Klein, Bruce Reed. Bull-Reducible Berge Graphs are Perfect
Euroconference on Combinatorics, Graph Theory and Applications - COMB'01, 2001, Barcelone, Spain, 3 p
...
inria-00071914v1  Reports
Olivier Devillers, Vida Dujmovic, Hazel Everett, Xavier Goaoc, Sylvain Lazard et al.  The expected number of 3D visibility events is linear
[Research Report] RR-4671, INRIA. 2002
...
inria-00099449v1  Conference papers
Hervé Brönnimann, Olivier Devillers, Vida Dujmovic, Hazel Everett, Marc 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-00071719v1  Reports
Hervé Brönnimann, Hazel Everett, Sylvain Lazard, Frank Sottile, Sue Whitesides. Transversals to Line Segments in R^3
[Research Report] RR-4864, INRIA. 2003
...
inria-00099479v1  Conference papers
Hervé Bronnimann, Hazel Everett, Sylvain Lazard, Frank Sottile, Sue 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 Devillers, Vida Dujmovic, Hazel Everett, Xavier Goaoc, Sylvain 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-00099529v1  Journal articles
Prosenjit Bose, Hazel Everett, Steve Wismath. Properties of Arrangements Graphs
International Journal of Computational Geometry and Applications, World Scientific Publishing, 2003, 13 (6), pp.447-462
...
inria-00103995v1  Conference papers
Hervé Brönnimann, Olivier Devillers, Vida Dujmovic, Hazel Everett, Marc 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-00077116v1  Reports
Olivier Devillers, Vida Dujmovic, Hazel Everett, Samuel Hornus, Sue Whitesides et al.  Maintaining Visibility Information of Planar Point Sets with a Moving Viewpoint
[Research Report] RR-5742, INRIA. 2005, pp.11
...
inria-00071226v1  Reports
Hervé Brönnimann, Olivier Devillers, Vida Dujmovic, Hazel Everett, Marc Glisse et al.  On the Number of Maximal Free Line Segments Tangent to Arbitrary Three-dimensional Convex Polyhedra
[Research Report] RR-5671, INRIA. 2005
...
inria-00000384v1  Journal articles
Hervé Brönnimann, Hazel Everett, Sylvain Lazard, Frank Sottile, Sue 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-00071219v1  Reports
Olivier Devillers, Hazel Everett, Sylvain Lazard, Maria Pentcheva, Stephen Wismath. Drawing $K_n$ in Three Dimensions with One Bend per Edge
[Research Report] RR-5708, INRIA. 2005
...
inria-00000373v2  Conference papers
Hazel Everett, Sylvain Lazard, Sylvain Petitjean, Linqiao 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 Devillers, Vida Dujmovic, Hazel Everett, Samuel Hornus, Steve 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 Devillers, Hazel Everett, Sylvain Lazard, Maria Pentcheva, Stephen 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 Devillers, Hazel Everett, Sylvain Lazard, Maria Pentcheva, Steve 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-00070203v1  Reports
Hazel Everett, Sylvain Lazard, Sylvain Petitjean, Linqiao Zhang. On the Expected Size of the 2D Visibility Complex
[Research Report] RR-5822, INRIA. 2006, pp.17
inria-00103952v1  Conference papers
Otfried Cheong, Hazel Everett, Sylvain Lazard, Hyo-Sil Kim, René 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 Everett, Sylvain Lazard, Bill Lenhart, Jeremy Redburn, Linqiao Zhang. Predicates for Line Transversals in 3D
18th Canadian Conference on Computational Geometry - CCCG 2006, Aug 2006, Kingston, Canada
...
inria-00172749v2  Reports
Hazel Everett, Daniel Lazard, Sylvain Lazard, Mohab Safey El Din. The Voronoi Diagram of Three Lines
[Research Report] RR-6295, INRIA. 2007, pp.38
...
inria-00186262v2  Reports
Julien Demouth, Olivier Devillers, Hazel Everett, Marc Glisse, Sylvain Lazard et al.  On the Complexity of Umbra and Penumbra
[Research Report] RR-6347, INRIA. 2007, pp.28
Designed by Inria-IES Team : http://hal.inria.fr/    Hosted by HAL : http://hal.archives-ouvertes.fr/