Shuly Lev-Yehudi

Learn More
Visibility methods are often based on the existence of large convex occluders. We present an algorithm that for a given simple non-convex polygon P finds an approximate inner-cover by large convex polygons. The algorithm is based on an initial partitioning of P into a set C of disjoint convex polygons which are an exact tessellation of P . The algorithm(More)
In this paper we present a mathematical model of a generic urban scene, which can be used to answer a variety of visibility questions. Aside from its theoretical merit, the mathematical model provides an important analysis tool to optimize urban walkthrough algorithms. We formulate the probability for a given object to be visible from a given viewcell as a(More)
  • 1