Given a set of 2D points, enumerate all triples of points such that no other points is inside the triangle formed by those 3 points. I'm looking for an efficient (something hopefully as good as O(n^3)) solution.
Is there an algorithm like this out there? Thanks!
Aucun commentaire:
Enregistrer un commentaire