[Compgeom-discuss] Covering of points by smallest rectangle
nilesham15 at yahoo.com
Tue May 23 12:18:33 PDT 2006
I am given few A points, few B points, few C points in
plane. The problem is to find the smallest rectangle
which covers at
least one A, one B and one C point. The rectangle need
or need not be
aligned to the axis, whichever is easier and/or
computationally efficient. More emphasize is on
efficiency rather than optimality, hence approximate
but fast methods should help.
Please let me know if anybody is aware of similar
problem or some
solutions for this problem. Any
pointers/feedback/suggestions would be of great help
for me to start out.
Do You Yahoo!?
Tired of spam? Yahoo! Mail has the best spam protection around
More information about the Compgeom-discuss