| 2008 |
| 54 | 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 |
| 2007 |
| 53 | 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 |
| 52 | 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 |
| 51 | EE | Linqiao Zhang,
Hazel Everett,
Sylvain Lazard,
Sue Whitesides:
Towards an implementation of the 3D visibility skeleton.
Symposium on Computational Geometry 2007: 131-132 |
| 50 | EE | Hazel Everett,
Sylvain Lazard,
Daniel Lazard,
Mohab Safey El Din:
The voronoi diagram of three lines.
Symposium on Computational Geometry 2007: 255-264 |
| 49 | EE | Julien Demouth,
Olivier Devillers,
Hazel Everett,
Marc Glisse,
Sylvain Lazard,
Raimund Seidel:
Between umbra and penumbra.
Symposium on Computational Geometry 2007: 265-274 |
| 48 | EE | Olivier Devillers,
Vida Dujmovic,
Hazel Everett,
Samuel Hornus,
Sue Whitesides,
Stephen K. Wismath:
Maintaining Visibility Information of Planar Point Sets with a Moving Viewpoint.
Int. J. Comput. Geometry Appl. 17(4): 297-304 (2007) |
| 47 | 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) |
| 46 | 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) |
| 45 | 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 |
| 44 | EE | Otfried Cheong,
Hazel Everett,
Hyo-Sil Kim,
Sylvain Lazard,
René Schott:
Throwing Stones Inside Simple Polygons .
AAIM 2006: 185-193 |
| 43 | EE | Hazel Everett,
Sylvain Lazard,
William J. Lenhart,
Jeremy Redburn,
Linqiao Zhang:
Predicates for Line Transversals in 3D.
CCCG 2006 |
| 42 | 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 |
| 41 | EE | Hazel Everett,
Sylvain Lazard,
Sylvain Petitjean,
Linqiao Zhang:
An Experimental Assessment of the 2D Visibility Complex.
CCCG 2005: 298-301 |
| 40 | EE | Olivier Devillers,
Vida Dujmovic,
Hazel Everett,
Samuel Hornus,
Sue Whitesides,
Stephen K. Wismath:
Maintaining Visibility Information of Planar Point Sets with a Moving Viewpoint.
CCCG 2005: 302-305 |
| 39 | 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 |
| 38 | EE | Tetsuo Asano,
Mark de Berg,
Otfried Cheong,
Hazel Everett,
Herman J. Haverkort,
Naoki Katoh,
Alexander Wolff:
Optimal spanners for axis-aligned rectangles.
Comput. Geom. 30(1): 59-77 (2005) |
| 37 | 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 |
| 36 | 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 |
| 35 | EE | Hazel Everett,
Stephen K. Wismath:
Editorial.
Comput. Geom. 28(1): 1- (2004) |
| 34 | EE | Siu-Wing Cheng,
Otfried Cheong,
Hazel Everett,
René van Oostrum:
Hierarchical Decompositions and Circular Ray Shooting in Simple Polygons.
Discrete & Computational Geometry 32(3): 401-415 (2004) |
| 2003 |
| 33 | | Hervé Brönnimann,
Hazel Everett,
Sylvain Lazard,
Frank Sottile,
Sue Whitesides:
Transversals to line segments in R3.
CCCG 2003: 174-177 |
| 32 | 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) |
| 31 | EE | Prosenjit Bose,
Hazel Everett,
Stephen K. Wismath:
Properties of Arrangement Graphs.
Int. J. Comput. Geometry Appl. 13(6): 447-462 (2003) |
| 30 | 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 |
| 29 | 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 |
| 2001 |
| 28 | EE | Hazel Everett,
Celina M. Herrera de Figueiredo,
Sulamita Klein,
Bruce A. Reed:
Bull-Reducible Berge Graphs are Perfect.
Electronic Notes in Discrete Mathematics 10: 93-95 (2001) |
| 2000 |
| 27 | | Hazel Everett,
Chính T. Hoàng,
Kyriakos Kilakos,
Marc Noy:
Planar segment visibility graphs.
Comput. Geom. 16(4): 235-243 (2000) |
| 1999 |
| 26 | EE | Siu-Wing Cheng,
Hazel Everett,
Otfried Cheong,
René van Oostrum:
Hierarchical Vertical Decompositions, Ray Shooting, and Circular Arc Queries in Simple Polygons.
Symposium on Computational Geometry 1999: 227-236 |
| 25 | EE | Hazel Everett,
Ferran Hurtado,
Marc Noy:
Stabbing Information of a Simple Polygon.
Discrete Applied Mathematics 91(1-3): 67-82 (1999) |
| 1998 |
| 24 | EE | Hazel Everett,
Sylvain Lazard,
Steven M. Robbins,
H. Schröder,
Sue Whitesides:
Convexifying star-shaped polygons.
CCCG 1998 |
| 23 | | Hazel Everett,
Ivan Stojmenovic,
Pavel Valtr,
Sue Whitesides:
The largest k-ball in a d-dimensional box.
Comput. Geom. 11(2): 59-67 (1998) |
| 22 | | Mark de Berg,
Hazel Everett,
Leonidas J. Guibas:
The union of moving polygonal pseudodiscs - Combinatorial bounds and applications.
Comput. Geom. 11(2): 69-81 (1998) |
| 21 | EE | Márcia R. Cerioli,
Hazel Everett,
Celina M. Herrera de Figueiredo,
Sulamita Klein:
The Homogeneous Set Sandwich Problem.
Inf. Process. Lett. 67(1): 31-35 (1998) |
| 20 | EE | Prosenjit Bose,
Hazel Everett,
Sándor P. Fekete,
Michael E. Houle,
Anna Lubiw,
Henk Meijer,
Kathleen Romanik,
Günter Rote,
Thomas C. Shermer,
Sue Whitesides,
Christian Zelle:
A Visibility Representation for Graphs in Three Dimensions.
J. Graph Algorithms Appl. 2(2): (1998) |
| 1997 |
| 19 | | Hazel Everett,
Chính T. Hoàng,
Kyriakos Kilakos,
Marc Noy:
Planar segment visibility graphs.
CCCG 1997 |
| 18 | | Hazel Everett,
Eduardo Rivera-Campo:
Edge Guarding Polyhedral Terrains.
Comput. Geom. 7: 201-203 (1997) |
| 17 | EE | Hazel Everett,
Sulamita Klein,
Bruce A. Reed:
An Algorithm for Finding Homogeneous Pairs.
Discrete Applied Mathematics 72(3): 209-218 (1997) |
| 16 | EE | Hazel Everett,
Celina M. Herrera de Figueiredo,
Cláudia Linhares Sales,
Frédéric Maffray,
Oscar Porto,
Bruce A. Reed:
Path parity and perfection.
Discrete Mathematics 165-166: 233-252 (1997) |
| 15 | | Jurek Czyzowicz,
Hazel Everett,
Jean-Marc Robert:
Separating Translates in the Plane: Combinatorial Bounds and an Algorithm.
Int. J. Comput. Geometry Appl. 7(6): 551-562 (1997) |
| 1996 |
| 14 | | Hazel Everett,
Ferran Hurtado,
Marc Noy:
Stabbing Information of a Simple Polygon.
CCCG 1996: 74-79 |
| 13 | | Hazel Everett,
Jean-Marc Robert,
Marc J. van Kreveld:
An optimal algorithm for the (<= k)-levels, with applications to separation and transversal problems.
Int. J. Comput. Geometry Appl. 6(3): 247-261 (1996) |
| 1995 |
| 12 | | Hazel Everett,
Derek G. Corneil:
Negative Results on Characterizing Visibility Graphs.
Comput. Geom. 5: 51-63 (1995) |
| 11 | | Mark de Berg,
Hazel Everett,
Hubert Wagener:
Translation queries for sets of polygons.
Int. J. Comput. Geometry Appl. 5(3): 221-242 (1995) |
| 1994 |
| 10 | | Hazel Everett,
Eduardo Rivera-Campo:
Edge Guarding a Triangulated Polyhedral Terrain.
CCCG 1994: 293-295 |
| 9 | | Jurek Czyzowicz,
Hazel Everett,
Jean-Marc Robert:
Separating Translates in the Plane: Combinatorial Bounds and an Algorithm.
SWAT 1994: 107-118 |
| 1993 |
| 8 | | Hazel Everett,
Anna Lubiw,
Joseph O'Rourke:
Recovery of Convex Hulls From External Visibility Graphs.
CCCG 1993: 309-314 |
| 7 | EE | Hazel Everett,
Jean-Marc Robert,
Marc J. van Kreveld:
An Optimal Algorithm for the (<= k)-Levels, with Applications to Separation and Transversal Problems.
Symposium on Computational Geometry 1993: 38-46 |
| 6 | EE | Hossam A. ElGindy,
Hazel Everett,
Godfried T. Toussaint:
Slicing an ear using prune-and-search.
Pattern Recognition Letters 14(9): 719-722 (1993) |
| 1991 |
| 5 | | Jirel Czyzowicz,
Peter Egyed,
Hazel Everett,
David Rappaport,
Thomas C. Shermer,
Diane L. Souvaine,
Godfried T. Toussaint,
Jorge Urrutia:
The Aquarium Keeper's Problem.
SODA 1991: 459-464 |
| 4 | EE | Binay K. Bhattacharya,
Hazel Everett,
Godfried T. Toussaint:
A counterexample to a dynamic algorithm for convex hulls of line arrangements.
Pattern Recognition Letters 12(3): 145-147 (1991) |
| 1990 |
| 3 | | Hazel Everett,
Derek G. Corneil:
Recognizing Visibility Graphs of Spiral Polygons.
J. Algorithms 11(1): 1-26 (1990) |
| 2 | EE | Xianshu Kong,
Hazel Everett,
Godfried T. Toussaint:
The Graham scan triangulates simple polygons.
Pattern Recognition Letters 11(11): 713-716 (1990) |
| 1989 |
| 1 | | Hazel Everett,
A. Gupta:
Acyclic Directed Hypercubes may have Exponential Diameter.
Inf. Process. Lett. 32(5): 243-245 (1989) |