Publication not explained
This publication has not yet been explained in plain language by the author(s). However, you can still read the publication.
If you are one of the authors, claim this publication so you can create a plain langauage summary to help more people find, understand and use it.
Read the Original
This page is a summary of: Simple and Fast Oexp(N) Algorithm for Finding an Exact Maximum Distance in E2 Instead of O(N^2) or O(N lgN), January 2019, Springer Science + Business Media, DOI: 10.1007/978-3-030-24289-3_27.
You can read the full text:
The following have contributed to this page