Is there an easy way to calculate by how much geometries (say polygons) overlap? I am thinking of the collision-detection problem of 'penetration depth'. The distance method returns zero for overlapping polygons - could this be amended to give a negative distance?
Would my request require something like the GJK algorithm, and would that be difficult to implement? Jim Jim Kay Senior Engineer Interfleet Technology Ltd email: [email protected] tel: +44 (0) 1332 223229 fax: +44 (0) 1332 223181 mobile: +44 (0) 7715 536828 web: www.interfleet.co.uk Interfleet Technology Ltd Interfleet House Pride Parkway Derby DE24 8HX ********************************************************************** Interfleet Technology Ltd Interfleet Technology's email disclaimer is found via the following URL: http://www.interfleet-technology.com/disclaimer.asp Registered Offices: http://www.interfleet-technology.com/offices.asp Please consider the environment before printing this e-mail. **********************************************************************
_______________________________________________ jts-devel mailing list [email protected] http://lists.refractions.net/mailman/listinfo/jts-devel
