Simple and Fast Oexp(N) Algorithm for Finding an Exact Maximum Distance in E2 Instead of O(N^2) or O(N lgN)

  • Vaclav Skala, Michal Smolik
  • January 2019, Springer Science + Business Media
  • DOI: 10.1007/978-3-030-24289-3_27

The authors haven't finished explaining this publication. If you are the author, sign in to claim or explain your work.

Read Publication

http://dx.doi.org/10.1007/978-3-030-24289-3_27

The following have contributed to this page: Prof. Vaclav Skala