Name
Abstract | ||
|---|---|---|
We show how to represent a simple polygon P by a (pixel-based) grid polygon Q that is simple and whose Hausdorff or Frechet distance to P is small. For any simple polygon P, a grid polygon exists with constant Hausdorff distance between their boundaries and their interiors. Moreover, we show that with a realistic input assumption we can also realize constant Frechet distance between the boundaries. We present algorithms accompanying these constructions, heuristics to improve their output while keeping the distance bounds, and experiments to assess the output. |
Year | Venue | DocType |
|---|---|---|
2016 | ESA | Conference |
Volume | Citations | PageRank |
abs/1606.06660 | 0 | 0.34 |
References | Authors | |
0 | 6 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Quirijn W. Bouts | 1 | 10 | 3.05 |
| Irina Kostitsyna | 2 | 33 | 18.08 |
| Marc J. van Kreveld | 3 | 1702 | 166.91 |
| W Wouter Meulemans | 4 | 130 | 18.74 |
| Willem Sonke | 5 | 0 | 0.34 |
| Kevin Verbeek | 6 | 74 | 13.18 |