A lower bound on Voronoi diagram complexity

  • Authors:
  • Boris Aronov

  • Affiliations:
  • Department of Computer and Information Science, Polytechnic University, Brooklyn, NY

  • Venue:
  • Information Processing Letters
  • Year:
  • 2002

Quantified Score

Hi-index 0.89

Visualization

Abstract