Hazel Everett

Publication Activity (10 Years)

Years Active: 1989-2011
Publications (10 Years): 0

Publications

Otfried Cheong, Hazel Everett, Marc Glisse, Joachim Gudmundsson, Samuel Hornus, Sylvain Lazard, Mira Lee, Hyeon-Suk Na
Farthest-polygon Voronoi diagrams. Comput. Geom. 44 (4) (2011)
Hazel Everett, Sylvain Lazard, Giuseppe Liotta, Stephen K. Wismath
Vertices. Discret. Comput. Geom. 43 (2) (2010)
Otfried Cheong, Hazel Everett, Marc Glisse, Joachim Gudmundsson, Samuel Hornus, Sylvain Lazard, Mira Lee, Hyeon-Suk Na
Farthest-Polygon Voronoi Diagrams CoRR (2010)
Hazel Everett, Sylvain Lazard, William Lenhart, Linqiao Zhang
On the degree of standard geometric predicates for line transversals in 3D. Comput. Geom. 42 (5) (2009)
Hazel Everett, Daniel Lazard, Sylvain Lazard, Mohab Safey El Din
The Voronoi Diagram of Three Lines. Discret. Comput. Geom. 42 (1) (2009)
Julien Demouth, Olivier Devillers, Hazel Everett, Marc Glisse, Sylvain Lazard, Raimund Seidel
On the complexity of umbra and penumbra. Comput. Geom. 42 (8) (2009)
Linqiao Zhang, Hazel Everett, Sylvain Lazard, Christophe Weibel, Sue Whitesides
On the Size of the 3D Visibility Skeleton: Experimental Results. ESA (2008)
Linqiao Zhang, Hazel Everett, Sylvain Lazard, Sue Whitesides
Towards an implementation of the 3D visibility skeleton. SCG (2007)
Otfried Cheong, Hazel Everett, Hyo-Sil Kim, Sylvain Lazard, René Schott
Parabola Separation Queries and their Application to Stone Throwing. Int. J. Comput. Geom. Appl. 17 (4) (2007)
Hazel Everett, Sylvain Lazard, Giuseppe Liotta, Stephen K. Wismath
Vertices. Graph Drawing (2007)
Hazel Everett, Sylvain Lazard, Daniel Lazard, Mohab Safey El Din
The voronoi diagram of three lines. SCG (2007)
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. Geom. Appl. 17 (4) (2007)
Hazel Everett, Sylvain Lazard, Sylvain Petitjean, Linqiao Zhang
On the Expected Size of the 2D Visibility Complex. Int. J. Comput. Geom. Appl. 17 (4) (2007)
Otfried Cheong, Hazel Everett, Marc Glisse, Joachim Gudmundsson, Samuel Hornus, Sylvain Lazard, Mira Lee, Hyeon-Suk Na
Farthest-Polygon Voronoi Diagrams. ESA (2007)
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) (2007)
Julien Demouth, Olivier Devillers, Hazel Everett, Marc Glisse, Sylvain Lazard, Raimund Seidel
Between umbra and penumbra. SCG (2007)
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) (2006)
Otfried Cheong, Hazel Everett, Hyo-Sil Kim, Sylvain Lazard, René Schott
Throwing Stones Inside Simple Polygons . AAIM (2006)
Hazel Everett, Sylvain Lazard, William J. Lenhart, Jeremy Redburn, Linqiao Zhang
Predicates for Line Transversals in 3D. CCCG (2006)
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)
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) (2005)
Hazel Everett, Celina M. H. de Figueiredo, Sulamita Klein, Bruce A. Reed
The perfection and recognition of bull-reducible Berge graphs. RAIRO Theor. Informatics Appl. 39 (1) (2005)
Hervé Brönnimann, Hazel Everett, Sylvain Lazard, Frank Sottile, Sue Whitesides
Transversals to Line Segments in Three-Dimensional Space. Discret. Comput. Geom. 34 (3) (2005)
Olivier Devillers, Hazel Everett, Sylvain Lazard, Maria Pentcheva, Stephen K. Wismath
in Three Dimensions with One Bend Per Edge. Graph Drawing (2005)
Hazel Everett, Sylvain Lazard, Sylvain Petitjean, Linqiao Zhang
An Experimental Assessment of the 2D Visibility Complex. CCCG (2005)
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. SCG (2004)
Siu-Wing Cheng, Otfried Cheong, Hazel Everett, René van Oostrum
Hierarchical Decompositions and Circular Ray Shooting in Simple Polygons. Discret. Comput. Geom. 32 (3) (2004)
Hazel Everett, Stephen K. Wismath
Editorial. Comput. Geom. 28 (1) (2004)
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) (2003)
Hervé Brönnimann, Hazel Everett, Sylvain Lazard, Frank Sottile, Sue Whitesides
. CCCG (2003)
Hervé Brönnimann, Hazel Everett, Sylvain Lazard, Frank Sottile, Sue Whitesides
The number of transversals to line segments in R^3 CoRR (2003)
Prosenjit Bose, Hazel Everett, Stephen K. Wismath
Properties of Arrangement Graphs. Int. J. Comput. Geom. Appl. 13 (6) (2003)
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)
Hazel Everett, Celina M. H. de Figueiredo, Sulamita Klein, Bruce A. Reed
Bull-Reducible Berge Graphs are Perfect. Electron. Notes Discret. Math. 10 (2001)
Hazel Everett, Chính T. Hoàng, Kyriakos Kilakos, Marc Noy
Planar segment visibility graphs. Comput. Geom. 16 (4) (2000)
Siu-Wing Cheng, Hazel Everett, Otfried Cheong, René van Oostrum
Hierarchical Vertical Decompositions, Ray Shooting, and Circular Arc Queries in Simple Polygons. SCG (1999)
Hazel Everett, Ferran Hurtado, Marc Noy
Stabbing Information of a Simple Polygon. Discret. Appl. Math. 91 (1-3) (1999)
Hazel Everett, Sylvain Lazard, Steven M. Robbins, H. Schröder, Sue Whitesides
Convexifying star-shaped polygons. CCCG (1998)
Hazel Everett, Ivan Stojmenovic, Pavel Valtr, Sue Whitesides
The largest k-ball in a d-dimensional box. Comput. Geom. 11 (2) (1998)
Mark de Berg, Hazel Everett, Leonidas J. Guibas
The union of moving polygonal pseudodiscs - Combinatorial bounds and applications. Comput. Geom. 11 (2) (1998)
Márcia R. Cerioli, Hazel Everett, Celina M. H. de Figueiredo, Sulamita Klein
The Homogeneous Set Sandwich Problem. Inf. Process. Lett. 67 (1) (1998)
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 (3) (1998)
Hazel Everett, Chính T. Hoàng, Kyriakos Kilakos, Marc Noy
Planar segment visibility graphs. CCCG (1997)
Jurek Czyzowicz, Hazel Everett, Jean-Marc Robert
Separating Translates in the Plane: Combinatorial Bounds and an Algorithm. Int. J. Comput. Geom. Appl. 7 (6) (1997)
Hazel Everett, Celina M. H. de Figueiredo, Cláudia Linhares Sales, Frédéric Maffray, Oscar Porto, Bruce A. Reed
Path parity and perfection. Discret. Math. (1997)
Hazel Everett, Sulamita Klein, Bruce A. Reed
An Algorithm for Finding Homogeneous Pairs. Discret. Appl. Math. 72 (3) (1997)
Hazel Everett, Eduardo Rivera-Campo
Edge Guarding Polyhedral Terrains. Comput. Geom. 7 (1997)
Hazel Everett, Ferran Hurtado, Marc Noy
Stabbing Information of a Simple Polygon. CCCG (1996)
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. Geom. Appl. 6 (3) (1996)
Mark de Berg, Hazel Everett, Hubert Wagener
Translation queries for sets of polygons. Int. J. Comput. Geom. Appl. 5 (3) (1995)
Hazel Everett, Derek G. Corneil
Negative Results on Characterizing Visibility Graphs. Comput. Geom. 5 (1995)
Leizhen Cai, Hazel Everett
Visibility graphs of polygonal rings. CCCG (1995)
Hazel Everett, Eduardo Rivera-Campo
Edge Guarding a Triangulated Polyhedral Terrain. CCCG (1994)
Jurek Czyzowicz, Hazel Everett, Jean-Marc Robert
Separating Translates in the Plane: Combinatorial Bounds and an Algorithm. SWAT (1994)
Hazel Everett, Jean-Marc Robert, Marc J. van Kreveld
An Optimal Algorithm for the (<= k)-Levels, with Applications to Separation and Transversal Problems. SCG (1993)
Hazel Everett, Anna Lubiw, Joseph O'Rourke
Recovery of Convex Hulls From External Visibility Graphs. CCCG (1993)
Hossam A. ElGindy, Hazel Everett, Godfried T. Toussaint
Slicing an ear using prune-and-search. Pattern Recognit. Lett. 14 (9) (1993)
Jurek 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)
Binay K. Bhattacharya, Hazel Everett, Godfried T. Toussaint
A counterexample to a dynamic algorithm for convex hulls of line arrangements. Pattern Recognit. Lett. 12 (3) (1991)
Hazel Everett, Derek G. Corneil
Recognizing Visibility Graphs of Spiral Polygons. J. Algorithms 11 (1) (1990)
Xianshu Kong, Hazel Everett, Godfried T. Toussaint
The Graham scan triangulates simple polygons. Pattern Recognit. Lett. 11 (11) (1990)
Hazel Everett, A. Gupta
Acyclic Directed Hypercubes may have Exponential Diameter. Inf. Process. Lett. 32 (5) (1989)