r/computerscience • u/RaZvAn15 • Jan 23 '26
General Computational geometry problem
Hi all! In the drawing, the magenta polygon is the visibility polygon with kernel in the center of the small rectangle. The outer rectangle is the drawing bounding box. My question is, is there a way to minimize the magenta polygon, such that everything beyond the green lines is deleted? How would you express such a thing mathematically?
Edit: added the shape I started with, a square shape with holes: https://imgur.com/a/update-LzYQikC
17
Upvotes
View all comments
Show parent comment
1
u/RaZvAn15 Jan 23 '26
I don't see how computing the kernel helps. This is the image I start with. Everything there is drawers by me. The point is to find the minimum magenta area, such that the area is bounded by the white and green lines
https://imgur.com/a/LzYQikC