collision detection - Finding a point in the intersection of two polygons -

collision detection - Finding a point in the intersection of two polygons -

for 2 convex polygons need find point within intersection. edges , vertices of intersection not count. don't have requirement of point needs relative edges of intersection, preferably somewhere in middle.

for collision detection utilize sap. if it's possible incorporate computation sap it'd since need high speed of execution. polygons have several vertices each, shapes simple.

a sweep line approach can used want - , sufficiently fast.

at first sort vertices of both polygons x-coordinate, sweep vertical line left right until find 2 intersecting segments - 1 first polygon, , sec 1 sec polygon. take internal point intersection of these segments , stop.

collision-detection computational-geometry