The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Hazel Everett: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Otfried Cheong, Hazel Everett, Hyo-Sil Kim, Sylvain Lazard, René Schott
    Throwing Stones Inside Simple Polygons . [Citation Graph (0, 0)][DBLP]
    AAIM, 2006, pp:185-193 [Conf]
  2. 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. [Citation Graph (0, 0)][DBLP]
    CCCG, 2002, pp:113-117 [Conf]
  3. Hervé Brönnimann, Hazel Everett, Sylvain Lazard, Frank Sottile, Sue Whitesides
    Transversals to line segments in R3. [Citation Graph (0, 0)][DBLP]
    CCCG, 2003, pp:174-177 [Conf]
  4. Olivier Devillers, Vida Dujmovic, Hazel Everett, Samuel Hornus, Sue Whitesides, Steve Wismath
    Maintaining Visibility Information of Planar Point Sets with a Moving Viewpoint. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:302-305 [Conf]
  5. Hazel Everett, Chính T. Hoàng, Kyriakos Kilakos, Marc Noy
    Planar segment visibility graphs. [Citation Graph (0, 0)][DBLP]
    CCCG, 1997, pp:- [Conf]
  6. Hazel Everett, Ferran Hurtado, Marc Noy
    Stabbing Information of a Simple Polygon. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:74-79 [Conf]
  7. Hazel Everett, Anna Lubiw, Joseph O'Rourke
    Recovery of Convex Hulls From External Visibility Graphs. [Citation Graph (0, 0)][DBLP]
    CCCG, 1993, pp:309-314 [Conf]
  8. Hazel Everett, Sylvain Lazard, Sylvain Petitjean, Linqiao Zhang
    An Experimental Assessment of the 2D Visibility Complex. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:298-301 [Conf]
  9. Hazel Everett, Sylvain Lazard, Steven M. Robbins, H. Schröder, Sue Whitesides
    Convexifying star-shaped polygons. [Citation Graph (0, 0)][DBLP]
    CCCG, 1998, pp:- [Conf]
  10. Hazel Everett, Eduardo Rivera-Campo
    Edge Guarding a Triangulated Polyhedral Terrain. [Citation Graph (0, 0)][DBLP]
    CCCG, 1994, pp:293-295 [Conf]
  11. 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. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2004, pp:46-55 [Conf]
  12. Siu-Wing Cheng, Hazel Everett, Otfried Cheong, René van Oostrum
    Hierarchical Vertical Decompositions, Ray Shooting, and Circular Arc Queries in Simple Polygons. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:227-236 [Conf]
  13. Hazel Everett, Jean-Marc Robert, Marc J. van Kreveld
    An Optimal Algorithm for the (<= k)-Levels, with Applications to Separation and Transversal Problems. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:38-46 [Conf]
  14. Julien Demouth, Olivier Devillers, Hazel Everett, Marc Glisse, Sylvain Lazard, Raimund Seidel
    Between umbra and penumbra. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2007, pp:265-274 [Conf]
  15. Hazel Everett, Sylvain Lazard, Daniel Lazard, Mohab Safey El Din
    The voronoi diagram of three lines. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2007, pp:255-264 [Conf]
  16. Linqiao Zhang, Hazel Everett, Sylvain Lazard, Sue Whitesides
    Towards an implementation of the 3D visibility skeleton. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2007, pp:131-132 [Conf]
  17. Olivier Devillers, Hazel Everett, Sylvain Lazard, Maria Pentcheva, Stephen K. Wismath
    Drawing Kn in Three Dimensions with One Bend Per Edge. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2005, pp:83-88 [Conf]
  18. Jirel Czyzowicz, Peter Egyed, Hazel Everett, David Rappaport, Thomas C. Shermer, Diane L. Souvaine, Godfried T. Toussaint, Jorge Urrutia
    The Aquarium Keeper's Problem. [Citation Graph (0, 0)][DBLP]
    SODA, 1991, pp:459-464 [Conf]
  19. Jurek Czyzowicz, Hazel Everett, Jean-Marc Robert
    Separating Translates in the Plane: Combinatorial Bounds and an Algorithm. [Citation Graph (0, 0)][DBLP]
    SWAT, 1994, pp:107-118 [Conf]
  20. Mark de Berg, Hazel Everett, Leonidas J. Guibas
    The union of moving polygonal pseudodiscs - Combinatorial bounds and applications. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1998, v:11, n:2, pp:69-81 [Journal]
  21. Tetsuo Asano, Mark de Berg, Otfried Cheong, Hazel Everett, Herman J. Haverkort, Naoki Katoh, Alexander Wolff
    Optimal spanners for axis-aligned rectangles. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2005, v:30, n:1, pp:59-77 [Journal]
  22. Hazel Everett, Chính T. Hoàng, Kyriakos Kilakos, Marc Noy
    Planar segment visibility graphs. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2000, v:16, n:4, pp:235-243 [Journal]
  23. Hazel Everett, Derek G. Corneil
    Negative Results on Characterizing Visibility Graphs. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1995, v:5, n:, pp:51-63 [Journal]
  24. Hazel Everett, Eduardo Rivera-Campo
    Edge Guarding Polyhedral Terrains. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1997, v:7, n:, pp:201-203 [Journal]
  25. Hazel Everett, Ivan Stojmenovic, Pavel Valtr, Sue Whitesides
    The largest k-ball in a d-dimensional box. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1998, v:11, n:2, pp:59-67 [Journal]
  26. Hazel Everett, Stephen K. Wismath
    Editorial. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2004, v:28, n:1, pp:1-0 [Journal]
  27. Hervé Brönnimann, Hazel Everett, Sylvain Lazard, Frank Sottile, Sue Whitesides
    The number of transversals to line segments in R^3 [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  28. Hazel Everett, Ferran Hurtado, Marc Noy
    Stabbing Information of a Simple Polygon. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:91, n:1-3, pp:67-82 [Journal]
  29. Hazel Everett, Sulamita Klein, Bruce A. Reed
    An Algorithm for Finding Homogeneous Pairs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:72, n:3, pp:209-218 [Journal]
  30. Hervé Brönnimann, Hazel Everett, Sylvain Lazard, Frank Sottile, Sue Whitesides
    Transversals to Line Segments in Three-Dimensional Space. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2005, v:34, n:3, pp:381-390 [Journal]
  31. Siu-Wing Cheng, Otfried Cheong, Hazel Everett, René van Oostrum
    Hierarchical Decompositions and Circular Ray Shooting in Simple Polygons. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2004, v:32, n:3, pp:401-415 [Journal]
  32. Prosenjit Bose, Hazel Everett, Stephen K. Wismath
    Properties of Arrangement Graphs. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2003, v:13, n:6, pp:447-462 [Journal]
  33. Mark de Berg, Hazel Everett, Hubert Wagener
    Translation queries for sets of polygons. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1995, v:5, n:3, pp:221-242 [Journal]
  34. Jurek Czyzowicz, Hazel Everett, Jean-Marc Robert
    Separating Translates in the Plane: Combinatorial Bounds and an Algorithm. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1997, v:7, n:6, pp:551-562 [Journal]
  35. Hazel Everett, Jean-Marc Robert, Marc J. van Kreveld
    An optimal algorithm for the (<= k)-levels, with applications to separation and transversal problems. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1996, v:6, n:3, pp:247-261 [Journal]
  36. Márcia R. Cerioli, Hazel Everett, Celina M. Herrera de Figueiredo, Sulamita Klein
    The Homogeneous Set Sandwich Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:67, n:1, pp:31-35 [Journal]
  37. Hazel Everett, A. Gupta
    Acyclic Directed Hypercubes may have Exponential Diameter. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1989, v:32, n:5, pp:243-245 [Journal]
  38. Hazel Everett, Derek G. Corneil
    Recognizing Visibility Graphs of Spiral Polygons. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1990, v:11, n:1, pp:1-26 [Journal]
  39. 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. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 1998, v:2, n:2, pp:- [Journal]
  40. Binay K. Bhattacharya, Hazel Everett, Godfried T. Toussaint
    A counterexample to a dynamic algorithm for convex hulls of line arrangements. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition Letters, 1991, v:12, n:3, pp:145-147 [Journal]
  41. Hossam A. ElGindy, Hazel Everett, Godfried T. Toussaint
    Slicing an ear using prune-and-search. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition Letters, 1993, v:14, n:9, pp:719-722 [Journal]
  42. Xianshu Kong, Hazel Everett, Godfried T. Toussaint
    The Graham scan triangulates simple polygons. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition Letters, 1990, v:11, n:11, pp:713-716 [Journal]
  43. Olivier Devillers, Vida Dujmovic, Hazel Everett, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sylvain Petitjean
    The Expected Number of 3D Visibility Events Is Linear. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2003, v:32, n:6, pp:1586-1620 [Journal]
  44. Hazel Everett, Sylvain Lazard, William J. Lenhart, Jeremy Redburn, Linqiao Zhang
    Predicates for Line Transversals in 3D. [Citation Graph (0, 0)][DBLP]
    CCCG, 2006, pp:- [Conf]
  45. Otfried Cheong, Hazel Everett, Marc Glisse, Joachim Gudmundsson, Samuel Hornus, Sylvain Lazard, Mira Lee, Hyeon-Suk Na
    Farthest-Polygon Voronoi Diagrams. [Citation Graph (0, 0)][DBLP]
    ESA, 2007, pp:407-418 [Conf]
  46. Hazel Everett, Celina M. Herrera de Figueiredo, Cláudia Linhares Sales, Frédéric Maffray, Oscar Porto, Bruce A. Reed
    Path parity and perfection. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:165, n:, pp:233-252 [Journal]
  47. 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. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:37, n:2, pp:522-551 [Journal]

  48. On the Size of the 3D Visibility Skeleton: Experimental Results. [Citation Graph (, )][DBLP]


  49. Universal Sets of n Points for 1-Bend Drawings of Planar Graphs with n Vertices. [Citation Graph (, )][DBLP]


  50. On the degree of standard geometric predicates for line transversals in 3D. [Citation Graph (, )][DBLP]


  51. On the complexity of umbra and penumbra. [Citation Graph (, )][DBLP]


  52. Farthest-Polygon Voronoi Diagrams [Citation Graph (, )][DBLP]


  53. The Voronoi Diagram of Three Lines. [Citation Graph (, )][DBLP]


  54. Universal Sets of n Points for One-bend Drawings of Planar Graphs with n Vertices. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.007secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002