default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHazel Everett
Person information
- affiliation: INRIA, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 1990
[b1]Hazel Everett:
Visibility graph recognition. University of Toronto, Canada, 1990
Journal Articles
- 2011
- [j36]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): 234-247 (2011) - 2010
- [j35]Hazel Everett, Sylvain Lazard, Giuseppe Liotta, Stephen K. Wismath:
Universal Sets of n Points for One-bend Drawings of Planar Graphs with n Vertices. Discret. Comput. Geom. 43(2): 272-288 (2010) - 2009
- [j34]Hazel Everett, Sylvain Lazard, William J. Lenhart, Linqiao Zhang:
On the degree of standard geometric predicates for line transversals in 3D. Comput. Geom. 42(5): 484-494 (2009) - [j33]Julien Demouth, Olivier Devillers, Hazel Everett, Marc Glisse, Sylvain Lazard, Raimund Seidel:
On the complexity of umbra and penumbra. Comput. Geom. 42(8): 758-771 (2009) - [j32]Hazel Everett, Daniel Lazard, Sylvain Lazard, Mohab Safey El Din:
The Voronoi Diagram of Three Lines. Discret. Comput. Geom. 42(1): 94-130 (2009) - 2007
- [j31]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): 297-304 (2007) - [j30]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): 349-360 (2007) - [j29]Hazel Everett, Sylvain Lazard, Sylvain Petitjean, Linqiao Zhang:
On the Expected Size of the 2D Visibility Complex. Int. J. Comput. Geom. Appl. 17(4): 361-381 (2007) - [j28]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
- [j27]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
- [j26]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) - [j25]Hervé Brönnimann, Hazel Everett, Sylvain Lazard, Frank Sottile, Sue Whitesides:
Transversals to Line Segments in Three-Dimensional Space. Discret. Comput. Geom. 34(3): 381-390 (2005) - [j24]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): 145-160 (2005) - 2004
- [j23]Hazel Everett, Stephen K. Wismath:
Editorial. Comput. Geom. 28(1): 1 (2004) - [j22]Siu-Wing Cheng, Otfried Cheong, Hazel Everett, René van Oostrum:
Hierarchical Decompositions and Circular Ray Shooting in Simple Polygons. Discret. Comput. Geom. 32(3): 401-415 (2004) - 2003
- [j21]Prosenjit Bose, Hazel Everett, Stephen K. Wismath:
Properties of Arrangement Graphs. Int. J. Comput. Geom. Appl. 13(6): 447-462 (2003) - [j20]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) - 2001
- [j19]Hazel Everett, Celina M. H. de Figueiredo, Sulamita Klein, Bruce A. Reed:
Bull-Reducible Berge Graphs are Perfect. Electron. Notes Discret. Math. 10: 93-95 (2001) - 2000
- [j18]Hazel Everett, Chính T. Hoàng, Kyriakos Kilakos, Marc Noy:
Planar segment visibility graphs. Comput. Geom. 16(4): 235-243 (2000) - 1999
- [j17]Hazel Everett, Ferran Hurtado, Marc Noy:
Stabbing Information of a Simple Polygon. Discret. Appl. Math. 91(1-3): 67-82 (1999) - 1998
- [j16]Hazel Everett, Ivan Stojmenovic, Pavel Valtr, Sue Whitesides:
The largest k-ball in a d-dimensional box. Comput. Geom. 11(2): 59-67 (1998) - [j15]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) - [j14]Márcia R. Cerioli, Hazel Everett, Celina M. H. de Figueiredo, Sulamita Klein:
The Homogeneous Set Sandwich Problem. Inf. Process. Lett. 67(1): 31-35 (1998) - [j13]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): 1-16 (1998) - 1997
- [j12]Hazel Everett, Eduardo Rivera-Campo:
Edge Guarding Polyhedral Terrains. Comput. Geom. 7: 201-203 (1997) - [j11]Hazel Everett, Sulamita Klein, Bruce A. Reed:
An Algorithm for Finding Homogeneous Pairs. Discret. Appl. Math. 72(3): 209-218 (1997) - [j10]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. 165-166: 233-252 (1997) - [j9]Jurek Czyzowicz, Hazel Everett, Jean-Marc Robert:
Separating Translates in the Plane: Combinatorial Bounds and an Algorithm. Int. J. Comput. Geom. Appl. 7(6): 551-562 (1997) - 1996
- [j8]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): 247-261 (1996) - 1995
- [j7]Hazel Everett, Derek G. Corneil:
Negative Results on Characterizing Visibility Graphs. Comput. Geom. 5: 51-63 (1995) - [j6]Mark de Berg, Hazel Everett, Hubert Wagener:
Translation queries for sets of polygons. Int. J. Comput. Geom. Appl. 5(3): 221-242 (1995) - 1993
- [j5]Hossam A. ElGindy, Hazel Everett, Godfried T. Toussaint:
Slicing an ear using prune-and-search. Pattern Recognit. Lett. 14(9): 719-722 (1993) - 1991
- [j4]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): 145-147 (1991) - 1990
- [j3]Hazel Everett, Derek G. Corneil:
Recognizing Visibility Graphs of Spiral Polygons. J. Algorithms 11(1): 1-26 (1990) - [j2]Xianshu Kong, Hazel Everett, Godfried T. Toussaint:
The Graham scan triangulates simple polygons. Pattern Recognit. Lett. 11(11): 713-716 (1990) - 1989
- [j1]Hazel Everett, A. Gupta:
Acyclic Directed Hypercubes may have Exponential Diameter. Inf. Process. Lett. 32(5): 243-245 (1989)
Conference and Workshop Papers
- 2008
- [c24]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
- [c23]Linqiao Zhang, Hazel Everett, Sylvain Lazard, Sue Whitesides:
Towards an implementation of the 3D visibility skeleton. SCG 2007: 131-132 - [c22]Hazel Everett, Sylvain Lazard, Daniel Lazard, Mohab Safey El Din:
The voronoi diagram of three lines. SCG 2007: 255-264 - [c21]Julien Demouth, Olivier Devillers, Hazel Everett, Marc Glisse, Sylvain Lazard, Raimund Seidel:
Between umbra and penumbra. SCG 2007: 265-274 - [c20]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 - [c19]Hazel Everett, Sylvain Lazard, Giuseppe Liotta, Stephen K. Wismath:
Universal Sets of n Points for 1-Bend Drawings of Planar Graphs with n Vertices. GD 2007: 345-351 - 2006
- [c18]Otfried Cheong, Hazel Everett, Hyo-Sil Kim, Sylvain Lazard, René Schott:
Throwing Stones Inside Simple Polygons . AAIM 2006: 185-193 - [c17]Hazel Everett, Sylvain Lazard, William J. Lenhart, Jeremy Redburn, Linqiao Zhang:
Predicates for Line Transversals in 3D. CCCG 2006 - 2005
- [c16]Hazel Everett, Sylvain Lazard, Sylvain Petitjean, Linqiao Zhang:
An Experimental Assessment of the 2D Visibility Complex. CCCG 2005: 298-301 - [c15]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 - [c14]Olivier Devillers, Hazel Everett, Sylvain Lazard, Maria Pentcheva, Stephen K. Wismath:
Drawing Kn in Three Dimensions with One Bend Per Edge. GD 2005: 83-88 - 2004
- [c13]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: 46-55 - 2003
- [c12]Hervé Brönnimann, Hazel Everett, Sylvain Lazard, Frank Sottile, Sue Whitesides:
Transversals to line segments in R3. CCCG 2003: 174-177 - 2002
- [c11]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 - 1999
- [c10]Siu-Wing Cheng, Hazel Everett, Otfried Cheong, René van Oostrum:
Hierarchical Vertical Decompositions, Ray Shooting, and Circular Arc Queries in Simple Polygons. SCG 1999: 227-236 - 1998
- [c9]Hazel Everett, Sylvain Lazard, Steven M. Robbins, H. Schröder, Sue Whitesides:
Convexifying star-shaped polygons. CCCG 1998 - 1997
- [c8]Hazel Everett, Chính T. Hoàng, Kyriakos Kilakos, Marc Noy:
Planar segment visibility graphs. CCCG 1997 - 1996
- [c7]Hazel Everett, Ferran Hurtado, Marc Noy:
Stabbing Information of a Simple Polygon. CCCG 1996: 74-79 - 1995
- [c6]Leizhen Cai, Hazel Everett:
Visibility graphs of polygonal rings. CCCG 1995: 157-161 - 1994
- [c5]Hazel Everett, Eduardo Rivera-Campo:
Edge Guarding a Triangulated Polyhedral Terrain. CCCG 1994: 293-295 - [c4]Jurek Czyzowicz, Hazel Everett, Jean-Marc Robert:
Separating Translates in the Plane: Combinatorial Bounds and an Algorithm. SWAT 1994: 107-118 - 1993
- [c3]Hazel Everett, Anna Lubiw, Joseph O'Rourke:
Recovery of Convex Hulls From External Visibility Graphs. CCCG 1993: 309-314 - [c2]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: 38-46 - 1991
- [c1]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: 459-464
Informal and Other Publications
- 2010
- [i2]Otfried Cheong, Hazel Everett, Marc Glisse, Joachim Gudmundsson, Samuel Hornus, Sylvain Lazard, Mira Lee, Hyeon-Suk Na:
Farthest-Polygon Voronoi Diagrams. CoRR abs/1001.3593 (2010) - 2003
- [i1]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)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-03 21:35 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
