#### Filter Results:

- Full text PDF available (52)

#### Publication Year

1945

2010

- This year (0)
- Last 5 years (0)
- Last 10 years (19)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Hervé Brönnimann, Olivier Devillers, +6 authors Sue Whitesides
- SIAM J. Comput.
- 2007

Motivated by visibility problems in three dimensions, we investigate the complexity and construction of the set of tangent lines in a scene of three-dimensional polyhedra. We prove that the set of lines tangent to four possibly intersecting convex polyhedra in R3 with a total of n edges consists of Θ(n2) connected components in the worst case. In the… (More)

- Olivier Devillers, Vida Dujmovic, +4 authors Sylvain Petitjean
- SIAM J. Comput.
- 2003

In this paper, we show that, amongst n uniformly distributed unit balls in R , the expected number of maximal non-occluded line segments tangent to four balls is linear, considerably improving the previously known upper bound. Using our techniques we show a linear bound on the expected size of the visibility complex, a data structure encoding the visibility… (More)

- Otfried Cheong, Hazel Everett, +5 authors Hyeon-Suk Na
- ESA
- 2007

Given a family of k disjoint connected polygonal sites in general position and of total complexity n, we consider the farthest-site Voronoi diagram of these sites, where the distance to a site is the distance to a closest point on it. We show that the complexity of this diagram is O(n), and give an O(n log n) time algorithm to compute it. We also prove a… (More)

- Hazel Everett, Eduardo Rivera-Campo
- CCCG
- 1994

- Hervé Brönnimann, Hazel Everett, Sylvain Lazard, Frank Sottile, Sue Whitesides
- Discrete & Computational Geometry
- 2005

We completely describe the structure of the connected components of transversals to a collection of n line segments in R. Generically, the set of transversal to four segments consist of zero or two lines. We catalog the non-generic cases and show that n > 3 arbitrary line segments in R admit at most n connected components of line transversals, and that this… (More)

- Hazel Everett, Derek G. Corneil
- J. Algorithms
- 1990

A simple polygon P is a closed chain of line segments in the plane with no two non-adjacent line segments intersecting. A polygon is represented by its boundary chain, an ordered sequence, [ u$, UT,. . . , v,*i J, of real-valued (x, -y) coordinates called the vertices of the polygon. Two vertices ur and u,? are visible if the closed line segment between… (More)

- Xianshu Kong, Hazel Everett, Godfried T. Toussaint
- Pattern Recognition Letters
- 1990

Given a set of n points in the plane, we consider the problem of computing the circular ordering of the points about a viewpoint q and efficiently maintaining this ordering information as q moves. In linear space, and after O(n log n) preprocessing time, our solution maintains the view at a cost of O(log n) amortized time (resp. O(log n) worst case time)… (More)

- Hazel Everett, Sylvain Lazard, William J. Lenhart, Linqiao Zhang
- Comput. Geom.
- 2009

In this paper we study various geometric predicates for determining the existence of and categorizing the configurations of lines in 3D that are transversal to lines or segments. We compute the degrees of standard procedures of evaluating these predicates. The degrees of some of these procedures are surprisingly high (up to 168), which may explain why… (More)

- Hazel Everett, Ivan Stojmenovic, Pavel Valtr, Sue Whitesides
- Comput. Geom.
- 1998