On the bit complexity of minimum link paths: superquadratic algorithms for problem solvable in linear time

  • Authors:
  • Simon Kahan;Jack Snoeyink

  • Affiliations:
  • -;-

  • Venue:
  • Selected papers from the 12th annual symposium on Computational Geometry
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract