List view
- No due date•4/4 issues closed
- Due by June 3, 2019•4/4 issues closed
Idea: determine whether a LOS passes through an arbitrary 3d closed polygon (representing for example the contour of a flange, or the aggregated contours of several objects obstructing the field of view) 1 version: * N LOS, M 3d closed polygons, return a 2d (N,M) array of booleans, True is LOS goes through, False otherwise Possible algorithms : * make semi-plane from LOS in any direction, count intersections with polygon (even vs odd) * triangulate polygon from barycenter, count intersections of LOS with triangulated surface (even vs odd)
Due by June 7, 2019•3/3 issues closed- Due by May 28, 2019•2/2 issues closed
- Due by May 17, 2019•6/6 issues closed