curt f13b3855c1 Sliver detection and elimination: ... After I clip a polygon against the more important stuff, I check the area and minimum interior angle of each of it's contours. If both (area and min interior angle) are below some threshhold I'm calling it a sliver. Then I go and look for another polygon such that result = polygon_union( poly, sliver ) yields a result that doesn't have anymore contours than the original poly. This means the sliver is adjacent to poly. So I replace poly with result (the union) and keep going.		1999-06-07 03:40:33 +00:00
..
Makefile.am	Renamed tripoly.* to polygon.*	1999-04-28 22:18:19 +00:00
polygon.cxx	Sliver detection and elimination:	1999-06-07 03:40:33 +00:00
polygon.hxx	Sliver detection and elimination:	1999-06-07 03:40:33 +00:00
triangle.cxx	Sliver detection and elimination:	1999-06-07 03:40:33 +00:00
triangle.hxx	Rewrote the polygon.[ch]xx class to save actual point data, rather than	1999-06-06 02:31:34 +00:00
trieles.cxx	Removed in-src cvs logs.	1999-04-06 23:37:07 +00:00
trieles.hxx	Removed in-src cvs logs.	1999-04-06 23:37:07 +00:00
trinodes.cxx	Rewrote the polygon.[ch]xx class to save actual point data, rather than	1999-06-06 02:31:34 +00:00
trinodes.hxx	Rewrote the polygon.[ch]xx class to save actual point data, rather than	1999-06-06 02:31:34 +00:00
trisegs.cxx	Debugging various problems with prepairing input that triangle() can	1999-05-19 02:51:07 +00:00
trisegs.hxx	Further restructuring to facilitate the tile edge matching process.	1999-05-02 22:11:30 +00:00