Paul Harrington

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
Lee and Drysdale [13] and Sharir [16] have given suboptimal ¢ ¤ £ ¦ ¥ ¨ § © ¥ algorithms for computing the Voronoi diagrams of line-segments or discs in the plane. This paper adapts their methods to constructing the Voronoi diagram for disjoint convex sites in three dimensions. Let £ ¦ ¥ be an upper bound on the number of features in any diagram involving ¥(More)
  • 1