Before revision:  Also, we show that the smallest largest-area triangle can be found in O(n^2 \log n) time .
After revision:  Also, we show that the smallest largest-area triangle can be done in O(n^2 \log n) time .