@TechReport{Dartmouth:TR2007-593,
  author = {Mark C. Henle},
  title = {{Closest and Farthest-Line Voronoi Diagrams in the Plane}},
  institution = {Dartmouth College, Computer Science},
  address = {Hanover, NH},
  number = {TR2007-593},
  year = {2007},
  month = {June},
  URL = {http://www.cs.dartmouth.edu/reports/TR2007-593.pdf},
  comment = {
    Senior Honors Thesis.  Advisor: Robert L. Scot Drysdale
  },
  abstract = {
     Voronoi diagrams are a geometric structure containing proximity
    information useful in efficiently answering a number of common
    geometric problems associated with a set of points in the plane.. They
    have applications in fields ranging from crystallography to biology.
    Diagrams of sites other than points and with different distance
    metrics have been studied.  This paper examines the Voronoi diagram of
    a set of lines, which has escaped study in the computational geometry
    literature. 
     The combinatorial and topological properties of the
    closest and farthest Voronoi diagrams are analyzed and O(n^2) and
    O(n log n) algorithms are presented for their computation
    respectively.
  }
}