Algorithms for Complex Shapes with Certified Numerics and Topology Minimizing the symmetric difference distance in conic spline approximation

@inproceedings{Ghosh2008AlgorithmsFC,
  title={Algorithms for Complex Shapes with Certified Numerics and Topology Minimizing the symmetric difference distance in conic spline approximation},
  author={Sunayana Ghosh and Gert Vegter},
  year={2008}
}
We show that the complexity (the number of elements) of an optimal parabolic or conic spline approximating a smooth curve with non-vanishing curvature to within symmetric difference distance ε is c1 ε −1/4 + O(1), if the spline consists of parabolic arcs and c2 ε −1/5 + O(1), if it is composed of general conic arcs of varying type. The constants c1 and c2… CONTINUE READING