The title pretty much explains it but I'm gonna go into more details. We have 3D mesh object and we want to decompose it into separate objects so that each one of these objects can be seen completely if we place a point somewhere inside them. The point location will not be random. We just need to make sure that there is a place inside the objects where the point can see the object completely.
If we speak in 2D terms, we are trying to break down the mesh in star-shaped polyhedrons.
There is an algorithm on this by Keil for the 2 dimensions (Minimum star-shaped decomposition) but I haven't found anything on 3D.
There are,however, papers on convex decomposition and this works but it will lead into more parts than I would like . Will I have to rely on these? How else should I approach this?
Extra notes: We have to do with polyhedrons with no holes and the decomposition doesn't have to be the minimum one.