Hazel Everett

According to our database, Hazel Everett authored at least 55 papers between 1989 and 2011.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2011

Farthest-polygon Voronoi diagrams.

Otfried Cheong, Hazel Everett, Marc Glisse, Joachim Gudmundsson, Samuel Hornus, Sylvain Lazard, Mira Lee, Hyeon-Suk Na

Comput. Geom., 2011

2010

Universal Sets of <i>n</i> Points for One-bend Drawings of Planar Graphs with <i>n</i> Vertices.

Hazel Everett, Sylvain Lazard, Giuseppe Liotta, Stephen K. Wismath

Discret. Comput. Geom., 2010

2009

The Voronoi Diagram of Three Lines.

Hazel Everett, Daniel Lazard, Sylvain Lazard, Mohab Safey El Din

Discret. Comput. Geom., 2009

On the degree of standard geometric predicates for line transversals in 3D.

Hazel Everett, Sylvain Lazard, William J. Lenhart, Linqiao Zhang

Comput. Geom., 2009

On the complexity of umbra and penumbra.

Julien Demouth, Olivier Devillers, Hazel Everett, Marc Glisse, Sylvain Lazard, Raimund Seidel

Comput. Geom., 2009

2008

On the Size of the 3D Visibility Skeleton: Experimental Results.

Linqiao Zhang, Hazel Everett, Sylvain Lazard, Christophe Weibel, Sue Whitesides

Proceedings of the Algorithms, 2008

2007

Lines and Free Line Segments Tangent to Arbitrary Three-Dimensional Convex Polyhedra.

Hervé Brönnimann, Olivier Devillers, Vida Dujmovic, Hazel Everett, Marc Glisse, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sue Whitesides

SIAM J. Comput., 2007

On the Expected Size of the 2D Visibility Complex.

Hazel Everett, Sylvain Lazard, Sylvain Petitjean, Linqiao Zhang

Int. J. Comput. Geom. Appl., 2007

Maintaining Visibility Information of Planar Point Sets with a Moving Viewpoint.

Olivier Devillers, Vida Dujmovic, Hazel Everett, Samuel Hornus, Sue Whitesides, Stephen K. Wismath

Int. J. Comput. Geom. Appl., 2007

Parabola Separation Queries and their Application to Stone Throwing.

Otfried Cheong, Hazel Everett, Hyo-Sil Kim, Sylvain Lazard, René Schott

Int. J. Comput. Geom. Appl., 2007

Universal Sets of <i>n</i> Points for 1-Bend Drawings of Planar Graphs with <i>n</i> Vertices.

Hazel Everett, Sylvain Lazard, Giuseppe Liotta, Stephen K. Wismath

Proceedings of the Graph Drawing, 15th International Symposium, 2007

Towards an implementation of the 3D visibility skeleton.

Linqiao Zhang, Hazel Everett, Sylvain Lazard, Sue Whitesides

Proceedings of the 23rd ACM Symposium on Computational Geometry, 2007

Between umbra and penumbra.

Julien Demouth, Olivier Devillers, Hazel Everett, Marc Glisse, Sylvain Lazard, Raimund Seidel

Proceedings of the 23rd ACM Symposium on Computational Geometry, 2007

2006

Drawing Kn in Three Dimensions with One Bend per Edge.

Olivier Devillers, Hazel Everett, Sylvain Lazard, Maria Pentcheva, Stephen K. Wismath

J. Graph Algorithms Appl., 2006

Predicates for Line Transversals in 3D.

Hazel Everett, Sylvain Lazard, William J. Lenhart, Jeremy Redburn, Linqiao Zhang

Proceedings of the 18th Annual Canadian Conference on Computational Geometry, 2006

Throwing Stones Inside Simple Polygons .

Otfried Cheong, Hazel Everett, Hyo-Sil Kim, Sylvain Lazard, René Schott

Proceedings of the Algorithmic Aspects in Information and Management, 2006

2005

The perfection and recognition of bull-reducible Berge graphs.

Hazel Everett, Celina M. H. de Figueiredo, Sulamita Klein, Bruce A. Reed

RAIRO Theor. Informatics Appl., 2005

Transversals to Line Segments in Three-Dimensional Space.

Hervé Brönnimann, Hazel Everett, Sylvain Lazard, Frank Sottile, Sue Whitesides

Discret. Comput. Geom., 2005

Optimal spanners for axis-aligned rectangles.

Tetsuo Asano, Mark de Berg, Otfried Cheong, Hazel Everett, Herman J. Haverkort, Naoki Katoh, Alexander Wolff

Comput. Geom., 2005

Drawing <i>K</i>_<i>n</i> in Three Dimensions with One Bend Per Edge.

Olivier Devillers, Hazel Everett, Sylvain Lazard, Maria Pentcheva, Stephen K. Wismath

Proceedings of the Graph Drawing, 13th International Symposium, 2005

An Experimental Assessment of the 2D Visibility Complex.

Hazel Everett, Sylvain Lazard, Sylvain Petitjean, Linqiao Zhang

Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

2004

Hierarchical Decompositions and Circular Ray Shooting in Simple Polygons.

Siu-Wing Cheng, Otfried Cheong, Hazel Everett, René van Oostrum

Discret. Comput. Geom., 2004

Editorial.

Hazel Everett, Stephen K. Wismath

Comput. Geom., 2004

The number of lines tangent to arbitrary convex polyhedra in 3D.

Hervé Brönnimann, Olivier Devillers, Vida Dujmovic, Hazel Everett, Marc Glisse, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sue Whitesides

Proceedings of the 20th ACM Symposium on Computational Geometry, 2004

2003

The Expected Number of 3D Visibility Events Is Linear.

Olivier Devillers, Vida Dujmovic, Hazel Everett, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sylvain Petitjean

SIAM J. Comput., 2003

Properties of Arrangement Graphs.

Prosenjit Bose, Hazel Everett, Stephen K. Wismath

Int. J. Comput. Geom. Appl., 2003

The number of transversals to line segments in R^3

Hervé Brönnimann, Hazel Everett, Sylvain Lazard, Frank Sottile, Sue Whitesides

CoRR, 2003

Transversals to line segments in R³.

Hervé Brönnimann, Hazel Everett, Sylvain Lazard, Frank Sottile, Sue Whitesides

Proceedings of the 15th Canadian Conference on Computational Geometry, 2003

2002

On the number of lines tangent to four convex polyhedra.

Hervé Brönnimann, Olivier Devillers, Vida Dujmovic, Hazel Everett, Marc Glisse, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sue Whitesides

Proceedings of the 14th Canadian Conference on Computational Geometry, 2002

2001

Bull-Reducible Berge Graphs are Perfect.

Hazel Everett, Celina M. H. de Figueiredo, Sulamita Klein, Bruce A. Reed

Electron. Notes Discret. Math., 2001

2000

Planar segment visibility graphs.

Hazel Everett, Chính T. Hoàng, Kyriakos Kilakos, Marc Noy

Comput. Geom., 2000

1999

Stabbing Information of a Simple Polygon.

Hazel Everett, Ferran Hurtado, Marc Noy

Discret. Appl. Math., 1999

Hierarchical Vertical Decompositions, Ray Shooting, and Circular Arc Queries in Simple Polygons.

Siu-Wing Cheng, Hazel Everett, Otfried Cheong, René van Oostrum

Proceedings of the Fifteenth Annual Symposium on Computational Geometry, 1999

1998

A Visibility Representation for Graphs in Three Dimensions.

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

J. Graph Algorithms Appl., 1998

The Homogeneous Set Sandwich Problem.

Márcia R. Cerioli, Hazel Everett, Celina M. H. de Figueiredo, Sulamita Klein

Inf. Process. Lett., 1998

The largest k-ball in a d-dimensional box.

Hazel Everett, Ivan Stojmenovic, Pavel Valtr, Sue Whitesides

Comput. Geom., 1998

The union of moving polygonal pseudodiscs - Combinatorial bounds and applications.

Mark de Berg, Hazel Everett, Leonidas J. Guibas

Comput. Geom., 1998

Convexifying star-shaped polygons.

Hazel Everett, Sylvain Lazard, Steven M. Robbins, H. Schröder, Sue Whitesides

Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

1997

Separating Translates in the Plane: Combinatorial Bounds and an Algorithm.

Jurek Czyzowicz, Hazel Everett, Jean-Marc Robert

Int. J. Comput. Geom. Appl., 1997

Path parity and perfection.

Hazel Everett, Celina M. H. de Figueiredo, Cláudia Linhares Sales, Frédéric Maffray, Oscar Porto, Bruce A. Reed

Discret. Math., 1997

An Algorithm for Finding Homogeneous Pairs.

Hazel Everett, Sulamita Klein, Bruce A. Reed

Discret. Appl. Math., 1997

Edge Guarding Polyhedral Terrains.

Hazel Everett, Eduardo Rivera-Campo

Comput. Geom., 1997

1996

An optimal algorithm for the (<= k)-levels, with applications to separation and transversal problems.

Hazel Everett, Jean-Marc Robert, Marc J. van Kreveld

Int. J. Comput. Geom. Appl., 1996

1995

Translation queries for sets of polygons.

Mark de Berg, Hazel Everett, Hubert Wagener

Int. J. Comput. Geom. Appl., 1995

Negative Results on Characterizing Visibility Graphs.

Hazel Everett, Derek G. Corneil

Comput. Geom., 1995

Visibility graphs of polygonal rings.

Leizhen Cai, Hazel Everett

Proceedings of the 7th Canadian Conference on Computational Geometry, 1995

1994

Edge Guarding a Triangulated Polyhedral Terrain.

Hazel Everett, Eduardo Rivera-Campo

Proceedings of the 6th Canadian Conference on Computational Geometry, 1994

1993

Slicing an ear using prune-and-search.

Hossam A. ElGindy, Hazel Everett, Godfried T. Toussaint

Pattern Recognit. Lett., 1993

Recovery of Convex Hulls From External Visibility Graphs.

Hazel Everett, Anna Lubiw, Joseph O'Rourke

Proceedings of the 5th Canadian Conference on Computational Geometry, 1993

1991

A counterexample to a dynamic algorithm for convex hulls of line arrangements.

Binay K. Bhattacharya, Hazel Everett, Godfried T. Toussaint

Pattern Recognit. Lett., 1991

The Aquarium Keeper's Problem.

Jurek Czyzowicz, Peter Egyed, Hazel Everett, David Rappaport, Thomas C. Shermer, Diane L. Souvaine, Godfried T. Toussaint, Jorge Urrutia

Proceedings of the Second Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1991

1990

Visibility graph recognition.

Hazel Everett

PhD thesis, 1990

The Graham scan triangulates simple polygons.

Xianshu Kong, Hazel Everett, Godfried T. Toussaint

Pattern Recognit. Lett., 1990

Recognizing Visibility Graphs of Spiral Polygons.

Hazel Everett, Derek G. Corneil

J. Algorithms, 1990

1989

Acyclic Directed Hypercubes may have Exponential Diameter.

Hazel Everett, A. Gupta

Inf. Process. Lett., 1989