- 1 STONE, H. Approximation of curves by line segments. Math. Comput. 15 (1961), 40-47.Google ScholarCross Ref
- 2 BELLMAN, Pt. Dynamic Programming. Princeton University Press, Princeton, N. J., 1957. Google ScholarDigital Library
- 3 BELLMAN, R., AND DREYFUS, S. Computational Aspects of Dynamic Programming. Princeton University Press, Princeton, N. J.; to appear. Google ScholarDigital Library
Index Terms
- On the approximation of curves by line segments using dynamic programming
Recommendations
Certified approximation of parametric space curves with cubic B-spline curves
Approximating complex curves with simple parametric curves is widely used in CAGD, CG, and CNC. This paper presents an algorithm to compute a certified approximation to a given parametric space curve with cubic B-spline curves. By certified, we mean ...
Approximability of covering cells with line segments
AbstractKorman et al. [18] studied the following geometric covering problem: given a set S of n line segments in the plane, find a minimum number of line segments such that every cell in the arrangement of the line segments is covered. Here, a ...
Comments