Optimal simplification of polygonal chain for rendering

  title={Optimal simplification of polygonal chain for rendering},
  author={Lilian Buzer},
  booktitle={Symposium on Computational Geometry},
For a given polygonal chain, we study the min problem, which consists in finding an approximate and ordered subchain with a minimum number of vertices. Previous approaches simplify the input chain relative to an approximation criterion which minimizes the gap between the original chain and the simplified subchain. Nevertheless, no criterion allows us to directly control the visual quality of the final rendered result. Moreover, efficient methods produce peculiar simplifications or entail a… CONTINUE READING