Is there a clean Java method for merging the points of two given overlapping polygons into one polygon?
What you want is a Convex Hull Algorithm it will take a set of points and return a minimal set of points that encloses the original points. This can be done in n.log n time.