Points_in_Plane_Triangles

[Irwin Scollar]

Given a large scatter of points bounded by a convex hull on a plane, find 
three points in the scatter which are the vertices of a triangle which has an 
area larger than that defined by any other set of three points.

Can anyone supply a reference to an efficient algorithm and a data 
structure for solving this problem faster than by brute force or suggest a 
method for dealing with it if nothing has been published?


Irwin Scollar
Cologne University
AL001 at MAIL1.RRZ.UNI-KOELN.DE

-------------
The compgeom mailing lists: see
http://netlib.bell-labs.com/netlib/compgeom/readme.html
or send mail to compgeom-request at research.bell-labs.com with the line:
send readme
Now archived at http://uiuc.edu/~sariel/CG/compgeom/threads.html.