while ( current != last ) {
p = cart_to_polar_2d( *current );
out_list.push_back(p);
- current++;
+ ++current;
}
return out_list;
last = rad_list.end();
while ( current != last ) {
printf("(%.2f, %.2f)\n", current->theta, current->dist);
- current++;
+ ++current;
}
printf("\n");
*/
current->theta -= FG_2PI;
}
// printf("(%.2f, %.2f)\n", current->theta, current->dist);
- current++;
+ ++current;
}
// printf("\n");
p.lat *= RAD_TO_DEG;
// printf("(%.8f, %.8f)\n", p.lon, p.lat);
result_list.push_back(p);
- current++;
+ ++current;
}
// printf("\n");
last = tmp_list.end();
while ( current != last ) {
printf("(%.2f, %.2f)\n", current->x, current->y);
- current++;
+ ++current;
}
printf("\n");
*/
last = result_list.end();
while ( current != last ) {
printf("(%.8f, %.8f)\n", current->lon, current->lat);
- current++;
+ ++current;
}
printf("\n");
*/
// $Log$
+// Revision 1.3 1998/09/09 16:26:31 curt
+// Continued progress in implementing the convex hull algorithm.
+//
// Revision 1.2 1998/09/04 23:04:48 curt
// Beginning of convex hull genereration routine.
//