Hazel Everett

63 papers A* 1A 4C 1Journal 38Unranked 18
YearRankTypeTitle / Venue / Authors
2011 J jnl
Farthest-polygon Voronoi diagrams.
Comput. Geom.
Otfried Cheong, Hazel Everett, Marc Glisse, Joachim Gudmundsson, Samuel Hornus, Sylvain Lazard, Mira Lee, Hyeon-Suk Na
2010 J jnl
Farthest-Polygon Voronoi Diagrams
CoRR
Otfried Cheong, Hazel Everett, Marc Glisse, Joachim Gudmundsson, Samuel Hornus, Sylvain Lazard, Mira Lee, Hyeon-Suk Na
2010 J jnl
Universal Sets of
Discret. Comput. Geom.
Hazel Everett, Sylvain Lazard, Giuseppe Liotta, Stephen K. Wismath
2009 J jnl
On the complexity of umbra and penumbra.
Comput. Geom.
Julien Demouth, Olivier Devillers, Hazel Everett, Marc Glisse, Sylvain Lazard, Raimund Seidel
2009 J jnl
On the degree of standard geometric predicates for line transversals in 3D.
Comput. Geom.
Hazel Everett, Sylvain Lazard, William J. Lenhart, Linqiao Zhang
2009 J jnl
The Voronoi Diagram of Three Lines.
Discret. Comput. Geom.
Hazel Everett, Daniel Lazard, Sylvain Lazard, Mohab Safey El Din
2008 A conf
On the Size of the 3D Visibility Skeleton: Experimental Results.
ESA
Linqiao Zhang, Hazel Everett, Sylvain Lazard, Christophe Weibel, Sue Whitesides
2007 — conf
Between umbra and penumbra.
SCG
Julien Demouth, Olivier Devillers, Hazel Everett, Marc Glisse, Sylvain Lazard, Raimund Seidel
2007 A conf
Farthest-Polygon Voronoi Diagrams.
ESA
Otfried Cheong, Hazel Everett, Marc Glisse, Joachim Gudmundsson, Samuel Hornus, Sylvain Lazard, Mira Lee, Hyeon-Suk Na
2007 J jnl
Lines and Free Line Segments Tangent to Arbitrary Three-Dimensional Convex Polyhedra.
SIAM J. Comput.
Hervé Brönnimann, Olivier Devillers, Vida Dujmovic, Hazel Everett, Marc Glisse, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sue Whitesides
2007 J jnl
Maintaining Visibility Information of Planar Point Sets with a Moving Viewpoint.
Int. J. Comput. Geom. Appl.
Olivier Devillers, Vida Dujmovic, Hazel Everett, Samuel Hornus, Sue Whitesides, Stephen K. Wismath
2007 J jnl
On the Expected Size of the 2D Visibility Complex.
Int. J. Comput. Geom. Appl.
Hazel Everett, Sylvain Lazard, Sylvain Petitjean, Linqiao Zhang
2007 J jnl
Parabola Separation Queries and their Application to Stone Throwing.
Int. J. Comput. Geom. Appl.
Otfried Cheong, Hazel Everett, Hyo-Sil Kim, Sylvain Lazard, René Schott
2007 — conf
The voronoi diagram of three lines.
SCG
Hazel Everett, Sylvain Lazard, Daniel Lazard, Mohab Safey El Din
2007 — conf
Towards an implementation of the 3D visibility skeleton.
SCG
Linqiao Zhang, Hazel Everett, Sylvain Lazard, Sue Whitesides
2007 A conf
Universal Sets of
GD
Hazel Everett, Sylvain Lazard, Giuseppe Liotta, Stephen K. Wismath
2006 J jnl
Drawing Kn in Three Dimensions with One Bend per Edge.
J. Graph Algorithms Appl.
Olivier Devillers, Hazel Everett, Sylvain Lazard, Maria Pentcheva, Stephen K. Wismath
2006 — conf
Predicates for Line Transversals in 3D.
CCCG
Hazel Everett, Sylvain Lazard, William J. Lenhart, Jeremy Redburn, Linqiao Zhang
2006 C conf
Throwing Stones Inside Simple Polygons .
AAIM
Otfried Cheong, Hazel Everett, Hyo-Sil Kim, Sylvain Lazard, René Schott
2005 — conf
An Experimental Assessment of the 2D Visibility Complex.
CCCG
Hazel Everett, Sylvain Lazard, Sylvain Petitjean, Linqiao Zhang
2005 A conf
Drawing
GD
Olivier Devillers, Hazel Everett, Sylvain Lazard, Maria Pentcheva, Stephen K. Wismath
2005 — conf
Maintaining Visibility Information of Planar Point Sets with a Moving Viewpoint.
CCCG
Olivier Devillers, Vida Dujmovic, Hazel Everett, Samuel Hornus, Sue Whitesides, Stephen K. Wismath
2005 J jnl
Optimal spanners for axis-aligned rectangles.
Comput. Geom.
Tetsuo Asano, Mark de Berg, Otfried Cheong, Hazel Everett, Herman J. Haverkort, Naoki Katoh, Alexander Wolff
2005 J jnl
The perfection and recognition of bull-reducible Berge graphs.
RAIRO Theor. Informatics Appl.
Hazel Everett, Celina M. H. de Figueiredo, Sulamita Klein, Bruce A. Reed
2005 J jnl
Transversals to Line Segments in Three-Dimensional Space.
Discret. Comput. Geom.
Hervé Brönnimann, Hazel Everett, Sylvain Lazard, Frank Sottile, Sue Whitesides
2004 J jnl
Editorial.
Comput. Geom.
Hazel Everett, Stephen K. Wismath
2004 J jnl
Hierarchical Decompositions and Circular Ray Shooting in Simple Polygons.
Discret. Comput. Geom.
Siu-Wing Cheng, Otfried Cheong, Hazel Everett, René van Oostrum
2004 — conf
The number of lines tangent to arbitrary convex polyhedra in 3D.
SCG
Hervé Brönnimann, Olivier Devillers, Vida Dujmovic, Hazel Everett, Marc Glisse, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sue Whitesides
2003 J jnl
Properties of Arrangement Graphs.
Int. J. Comput. Geom. Appl.
Prosenjit Bose, Hazel Everett, Stephen K. Wismath
2003 J jnl
The Expected Number of 3D Visibility Events Is Linear.
SIAM J. Comput.
Olivier Devillers, Vida Dujmovic, Hazel Everett, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sylvain Petitjean
2003 J jnl
The number of transversals to line segments in R^3
CoRR
Hervé Brönnimann, Hazel Everett, Sylvain Lazard, Frank Sottile, Sue Whitesides
2003 — conf
Transversals to line segments in R
CCCG
Hervé Brönnimann, Hazel Everett, Sylvain Lazard, Frank Sottile, Sue Whitesides
2002 — conf
On the number of lines tangent to four convex polyhedra.
CCCG
Hervé Brönnimann, Olivier Devillers, Vida Dujmovic, Hazel Everett, Marc Glisse, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sue Whitesides
2001 J jnl
Bull-Reducible Berge Graphs are Perfect.
Electron. Notes Discret. Math.
Hazel Everett, Celina M. H. de Figueiredo, Sulamita Klein, Bruce A. Reed
2000 J jnl
Planar segment visibility graphs.
Comput. Geom.
Hazel Everett, Chính T. Hoàng, Kyriakos Kilakos, Marc Noy
1999 — conf
Hierarchical Vertical Decompositions, Ray Shooting, and Circular Arc Queries in Simple Polygons.
SCG
Siu-Wing Cheng, Hazel Everett, Otfried Cheong, René van Oostrum
1999 J jnl
Stabbing Information of a Simple Polygon.
Discret. Appl. Math.
Hazel Everett, Ferran Hurtado, Marc Noy
1998 J jnl
A Visibility Representation for Graphs in Three Dimensions.
J. Graph Algorithms Appl.
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
1998 — conf
Convexifying star-shaped polygons.
CCCG
Hazel Everett, Sylvain Lazard, Steven M. Robbins, H. Schröder, Sue Whitesides
1998 J jnl
The Homogeneous Set Sandwich Problem.
Inf. Process. Lett.
Márcia R. Cerioli, Hazel Everett, Celina M. H. de Figueiredo, Sulamita Klein
1998 J jnl
The largest k-ball in a d-dimensional box.
Comput. Geom.
Hazel Everett, Ivan Stojmenovic, Pavel Valtr, Sue Whitesides
1998 J jnl
The union of moving polygonal pseudodiscs - Combinatorial bounds and applications.
Comput. Geom.
Mark de Berg, Hazel Everett, Leonidas J. Guibas
1997 J jnl
An Algorithm for Finding Homogeneous Pairs.
Discret. Appl. Math.
Hazel Everett, Sulamita Klein, Bruce A. Reed
1997 J jnl
Edge Guarding Polyhedral Terrains.
Comput. Geom.
Hazel Everett, Eduardo Rivera-Campo
1997 J jnl
Path parity and perfection.
Discret. Math.
Hazel Everett, Celina M. H. de Figueiredo, Cláudia Linhares Sales, Frédéric Maffray, Oscar Porto, Bruce A. Reed
1997 — conf
Planar segment visibility graphs.
CCCG
Hazel Everett, Chính T. Hoàng, Kyriakos Kilakos, Marc Noy
1997 J jnl
Separating Translates in the Plane: Combinatorial Bounds and an Algorithm.
Int. J. Comput. Geom. Appl.
Jurek Czyzowicz, Hazel Everett, Jean-Marc Robert
1996 J jnl
An optimal algorithm for the (<= k)-levels, with applications to separation and transversal problems.
Int. J. Comput. Geom. Appl.
Hazel Everett, Jean-Marc Robert, Marc J. van Kreveld
1996 — conf
Stabbing Information of a Simple Polygon.
CCCG
Hazel Everett, Ferran Hurtado, Marc Noy
1995 J jnl
Negative Results on Characterizing Visibility Graphs.
Comput. Geom.
Hazel Everett, Derek G. Corneil
1995 J jnl
Translation queries for sets of polygons.
Int. J. Comput. Geom. Appl.
Mark de Berg, Hazel Everett, Hubert Wagener
1995 — conf
Visibility graphs of polygonal rings.
CCCG
Leizhen Cai, Hazel Everett
1994 — conf
Edge Guarding a Triangulated Polyhedral Terrain.
CCCG
Hazel Everett, Eduardo Rivera-Campo
1994 — conf
Separating Translates in the Plane: Combinatorial Bounds and an Algorithm.
SWAT
Jurek Czyzowicz, Hazel Everett, Jean-Marc Robert
1993 — conf
An Optimal Algorithm for the (<= k)-Levels, with Applications to Separation and Transversal Problems.
SCG
Hazel Everett, Jean-Marc Robert, Marc J. van Kreveld
1993 — conf
Recovery of Convex Hulls From External Visibility Graphs.
CCCG
Hazel Everett, Anna Lubiw, Joseph O'Rourke
1993 J jnl
Slicing an ear using prune-and-search.
Pattern Recognit. Lett.
Hossam A. ElGindy, Hazel Everett, Godfried T. Toussaint
1991 J jnl
A counterexample to a dynamic algorithm for convex hulls of line arrangements.
Pattern Recognit. Lett.
Binay K. Bhattacharya, Hazel Everett, Godfried T. Toussaint
1991 A* conf
The Aquarium Keeper's Problem.
SODA
Jurek Czyzowicz, Peter Egyed, Hazel Everett, David Rappaport, Thomas C. Shermer, Diane L. Souvaine, Godfried T. Toussaint, Jorge Urrutia
1990 J jnl
Recognizing Visibility Graphs of Spiral Polygons.
J. Algorithms
Hazel Everett, Derek G. Corneil
1990 J jnl
The Graham scan triangulates simple polygons.
Pattern Recognit. Lett.
Xianshu Kong, Hazel Everett, Godfried T. Toussaint
1990 — —
Visibility graph recognition.
Hazel Everett
1989 J jnl
Acyclic Directed Hypercubes may have Exponential Diameter.
Inf. Process. Lett.
Hazel Everett, A. Gupta