algorithm - Dynamic minimal polygons from intersections of other polygons -
let have polygons , polylines intersect , create other polygons intersections. interested in minimal ones in picture below:
let's consider polygon interests polygon 1, because contains point p in it. if triangle moves, polygon 1 change, in picture:
as can see, polygon 1 lot bigger , other polygons have changed somehow (but not care them). can of course reuse algorithm computes 6 polygons , select polygon 1 position of point p, looking more clever solution, use information of components of polygon 1 in initial state recompute faster.
Comments
Post a Comment