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:

enter image description here

let's consider polygon interests polygon 1, because contains point p in it. if triangle moves, polygon 1 change, in picture:

enter image description here

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

Popular posts from this blog

get url and add instance to a model with prefilled foreign key :django admin -

css - Make div keyboard-scrollable in jQuery Mobile? -

ruby on rails - Seeing duplicate requests handled with Unicorn -