return 1;
}
- int longest = 1;
- double distance = 0.0;
+ int longest = 2;
+ double distance = -Double.MAX_VALUE;
for (int i = 2; i < segCount; i += 2) {
double dx = segments.getQuick(i) - segments.getQuick(i-2);
double dy = segments.getQuick(i+1) - segments.getQuick(i-1);