Hazel Everett - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

Farthest-polygon Voronoi diagramsOtfried Cheong, Hazel Everett, Marc Glisse, Joachim Gudmundsson, Samuel Hornus, Sylvain Lazard, Mira Lee, Hyeon-Suk Na. comgeo, 44(4):234-247, 2011. [doi]

2010

Universal Sets of ::::n:::: Points for One-bend Drawings of Planar Graphs with ::::n:::: VerticesHazel Everett, Sylvain Lazard, Giuseppe Liotta, Stephen K. Wismath. dcg, 43(2):272-288, 2010. [doi]

2009

On the complexity of umbra and penumbraJulien Demouth, Olivier Devillers, Hazel Everett, Marc Glisse, Sylvain Lazard, Raimund Seidel. comgeo, 42(8):758-771, 2009. [doi]

The Voronoi Diagram of Three LinesHazel Everett, Daniel Lazard, Sylvain Lazard, Mohab Safey El Din. dcg, 42(1):94-130, 2009. [doi]

On the degree of standard geometric predicates for line transversals in 3DHazel Everett, Sylvain Lazard, William Lenhart, Linqiao Zhang. comgeo, 42(5):484-494, 2009. [doi]

2008

On the Size of the 3D Visibility Skeleton: Experimental ResultsLinqiao Zhang, Hazel Everett, Sylvain Lazard, Christophe Weibel, Sue Whitesides. esa 2008: 805-816 [doi]

2007

Lines and Free Line Segments Tangent to Arbitrary Three-Dimensional Convex PolyhedraHervé Brönnimann, Olivier Devillers, Vida Dujmovic, Hazel Everett, Marc Glisse, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sue Whitesides. siamcomp, 37(2):522-551, 2007. [doi]

Parabola Separation Queries and their Application to Stone ThrowingOtfried Cheong, Hazel Everett, Hyo-Sil Kim, Sylvain Lazard, René Schott. ijcga, 17(4):349-360, 2007. [doi]

Farthest-Polygon Voronoi DiagramsOtfried Cheong, Hazel Everett, Marc Glisse, Joachim Gudmundsson, Samuel Hornus, Sylvain Lazard, Mira Lee, Hyeon-Suk Na. esa 2007: 407-418 [doi]

Between umbra and penumbraJulien Demouth, Olivier Devillers, Hazel Everett, Marc Glisse, Sylvain Lazard, Raimund Seidel. compgeom 2007: 265-274 [doi]

Maintaining Visibility Information of Planar Point Sets with a Moving ViewpointOlivier Devillers, Vida Dujmovic, Hazel Everett, Samuel Hornus, Sue Whitesides, Stephen K. Wismath. ijcga, 17(4):297-304, 2007. [doi]

On the Expected Size of the 2D Visibility ComplexHazel Everett, Sylvain Lazard, Sylvain Petitjean, Linqiao Zhang. ijcga, 17(4):361-381, 2007. [doi]

The voronoi diagram of three linesHazel Everett, Sylvain Lazard, Daniel Lazard, Mohab Safey El Din. compgeom 2007: 255-264 [doi]

Universal Sets of ::::n:::: Points for 1-Bend Drawings of Planar Graphs with ::::n:::: VerticesHazel Everett, Sylvain Lazard, Giuseppe Liotta, Stephen K. Wismath. gd 2008: 345-351 [doi]

Towards an implementation of the 3D visibility skeletonLinqiao Zhang, Hazel Everett, Sylvain Lazard, Sue Whitesides. compgeom 2007: 131-132 [doi]

2006

2005

Optimal spanners for axis-aligned rectanglesTetsuo Asano, Mark de Berg, Otfried Cheong, Hazel Everett, Herman J. Haverkort, Naoki Katoh, Alexander Wolff. comgeo, 30(1):59-77, 2005. [doi]

Transversals to Line Segments in Three-Dimensional SpaceHervé Brönnimann, Hazel Everett, Sylvain Lazard, Frank Sottile, Sue Whitesides. dcg, 34(3):381-390, 2005. [doi]

Drawing ::::K::::::::::n:::::: in Three Dimensions with One Bend Per EdgeOlivier Devillers, Hazel Everett, Sylvain Lazard, Maria Pentcheva, Stephen K. Wismath. gd 2006: 83-88 [doi]

Maintaining Visibility Information of Planar Point Sets with a Moving ViewpointOlivier Devillers, Vida Dujmovic, Hazel Everett, Samuel Hornus, Sue Whitesides, Stephen K. Wismath. cccg 2005: 302-305 [doi]

An Experimental Assessment of the 2D Visibility ComplexHazel Everett, Sylvain Lazard, Sylvain Petitjean, Linqiao Zhang. cccg 2005: 298-301 [doi]

The perfection and recognition of bull-reducible Berge graphsHazel Everett, Celina M. Herrera de Figueiredo, Sulamita Klein, Bruce A. Reed. ita, 39(1):145-160, 2005. [doi]

2004

2003

2002

On the number of lines tangent to four convex polyhedraHervé Brönnimann, Olivier Devillers, Vida Dujmovic, Hazel Everett, Marc Glisse, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sue Whitesides. cccg 2002: 113-117 [doi]

2001

Bull-Reducible Berge Graphs are PerfectHazel Everett, Celina M. Herrera de Figueiredo, Sulamita Klein, Bruce A. Reed. endm, 10:93-95, 2001. [doi]

2000

Planar segment visibility graphsHazel Everett, Chính T. Hoàng, Kyriakos Kilakos, Marc Noy. comgeo, 16(4):235-243, 2000.

1999

Hierarchical Vertical Decompositions, Ray Shooting, and Circular Arc Queries in Simple PolygonsSiu-Wing Cheng, Hazel Everett, Otfried Cheong, René van Oostrum. compgeom 1999: 227-236 [doi]

Stabbing Information of a Simple PolygonHazel Everett, Ferran Hurtado, Marc Noy. DAM, 91(1-3):67-82, 1999. [doi]

1998

1997

1996

Stabbing Information of a Simple PolygonHazel Everett, Ferran Hurtado, Marc Noy. cccg 1996: 74-79

An optimal algorithm for the (<= k)-levels, with applications to separation and transversal problemsHazel Everett, Jean-Marc Robert, Marc J. van Kreveld. ijcga, 6(3):247-261, 1996.

1995

Translation queries for sets of polygonsMark de Berg, Hazel Everett, Hubert Wagener. ijcga, 5(3):221-242, 1995.

Negative Results on Characterizing Visibility GraphsHazel Everett, Derek G. Corneil. comgeo, 5:51-63, 1995.

1994

Separating Translates in the Plane: Combinatorial Bounds and an AlgorithmJurek Czyzowicz, Hazel Everett, Jean-Marc Robert. swat 1994: 107-118

Edge Guarding a Triangulated Polyhedral TerrainHazel Everett, Eduardo Rivera-Campo. cccg 1994: 293-295

1993

Slicing an ear using prune-and-searchHossam A. ElGindy, Hazel Everett, Godfried T. Toussaint. prl, 14(9):719-722, 1993. [doi]

An Optimal Algorithm for the (<= k)-Levels, with Applications to Separation and Transversal ProblemsHazel Everett, Jean-Marc Robert, Marc J. van Kreveld. compgeom 1993: 38-46 [doi]

Recovery of Convex Hulls From External Visibility GraphsHazel Everett, Anna Lubiw, Joseph O Rourke. cccg 1993: 309-314

1991

A counterexample to a dynamic algorithm for convex hulls of line arrangementsBinay K. Bhattacharya, Hazel Everett, Godfried T. Toussaint. prl, 12(3):145-147, 1991. [doi]

The Aquarium Keeper s ProblemJirel Czyzowicz, Peter Egyed, Hazel Everett, David Rappaport, Thomas C. Shermer, Diane L. Souvaine, Godfried T. Toussaint, Jorge Urrutia. soda 1991: 459-464

1990

Recognizing Visibility Graphs of Spiral PolygonsHazel Everett, Derek G. Corneil. jal, 11(1):1-26, 1990.

The Graham scan triangulates simple polygonsXianshu Kong, Hazel Everett, Godfried T. Toussaint. prl, 11(11):713-716, 1990. [doi]

1989

Acyclic Directed Hypercubes may have Exponential DiameterHazel Everett, A. Gupta. ipl, 32(5):243-245, 1989.