____ ____
| |
|____ |____
| *|
|____ ____|
____
| |
____| |____
| * |
|______________|
____
| |
| |____ ____
| * |
|____ ____ ____|
Hi all, the three shapes above are "concave" shapes formed by stacking
4 unit squares together. Given any point inside one of the boundaries
(say, "*" in the figures above), how does one algorithmically calculate
(or approximate) the area which is not within the line-of-sight of the
point (i.e. blocked by the bounadry)? Thank you!!
Regards,
Kam Mun Loong
Cooperative Systems Laboratory
NUS
--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to [email protected]
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/algogeeks
-~----------~----~----~----~------~----~------~--~---
