Name
Abstract | ||
|---|---|---|
Visibility methods are often based on the existence of large con- vex 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 then builds a set of large convex polygons contained in P by constructing the convex hulls of sub- sets of C. We discuss different strategies for selecting the subsets and we claim that in most cases our algorithm produces an effective approximation of P. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1142/S0218654303000139 | International Journal of Shape Modeling |
Keywords | DocType | Volume |
cover,convexity,partition,decomposition,visibility | Journal | 9 |
Issue | Citations | PageRank |
2 | 6 | 0.54 |
References | Authors | |
11 | 1 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Daniel Cohen-Or | 1 | 10588 | 533.55 |