Univariate cubic Lp splines and shape-preserving, multiscale interpolation by univariate cubic L1 splines

Computer Aided Geometric Design

Volumn 17, Issue 4, 2000, Pages 319-336

  Lavery, John E ^a  

^a U S ARMY RESEARCH LABORATORY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; INTERPOLATION; MATHEMATICAL MODELS;

MULTISCALE INTERPOLATION; SHAPE PRESERVATION;

COMPUTATIONAL GEOMETRY;

EID: 0034172471     PISSN: 01678396     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8396(00)00003-0     Document Type: Article

References (35)

1. Akima, H. (1970), A new method of interpolation and smooth curve fitting based on local procedures, J. Assoc. Comput. Mach. 17, 589-602.
2. Bloomfield, P. and Steiger, W.L. (1983), Least Absolute Deviations: Theory, Applications, and Algorithms, Birkhäuser, Boston.
3. Carlson, R.E. (1987), Shape preserving interpolation, in: Mason, J.C. and Cox, M.G., eds., Algorithms for Approximation, Clarendon Press, Oxford, 97-113.
4. Copley, P. and Schumaker, L.L. (1978), On plg-splines, J. Approx. Theory 23, 1-28.
5. de Boor, C. (1976), On "best" interpolation, J. Approx. Theory 16, 28-42.
6. de Boor, C. (1978), A practical guide to splines, Applied Mathematical Sciences 27, Springer, New York.
7. DeVore, R.A. and Lorentz, G.G. (1993), Constructive approximation, Grundlehren der Mathematischen Wissenschaften 303, Springer, Berlin.
8. Farin, G. (1997), Curves and Surfaces for Computer-aided Geometric Design: A Practical Guide, 4th Ed., Academic Press, San Diego.
9. 1 extremal problems in one and several variables, J. Approx. Theory 13, 73-83.
10. Fisher, S.D. and Jerome, J.W. (1975b), Minimum Norm Extremals in Function Spaces, Springer, New York.
11. Foulds, L.R. (1981), Optimization Techniques: An Introduction, Springer, New York.
12. Fritsch, F.N. and Carlson, R.E. (1980), Monotone piecewise cubic interpolation, SIAM J. Numer. Anal. 17, 238-246.
13. Gregory, J.A. (1987), A review of curve interpolation with shape control, in: Mason, J.C. and Cox, M.G., eds., Algorithms for Approximation, Clarendon Press, Oxford, 131-140.
14. Hiriart-Urruty, J.-B. and Lemaréchal, C. (1993), Convex analysis and minimization algorithms, Grundlehren Der Mathematischen Wissenschaften 305, 306, Springer, New York.
15. Hoschek, J. and Kaklis, P. (1996), Advanced Course on Fairshape, Teubner, Stuttgart.
16. Jerome, J.W. (1975), Smooth interpolating curves of prescribed length and minimum curvature, Proc. Amer. Math. Soc. 51, 62-66.
17. Lavery, J.E. (1989), Solution of steady-state one-dimensional conservation laws by mathematical programming, SIAM J. Numer. Anal. 26, 1081-1089.
18. Lavery, J.E. (1990), Calculation of shocked one-dimensional flows on abruptly changing grids by mathematical programming, J. Comput. Phys. 86, 1-17.
19. Lobo, M.S., Vandenberghe, L., Boyd, S. and Lebret, H. (1998), Applications of second-order cone programming, Linear Algebra and its Applications 284, 193-228.
20. Lustig, I.J., Morsten, R.E. and Shanno, D.F. (1994), Interior point methods for linear programming: Computational state of the art, ORSA J. Comput. 6, 1-14.
21. Mangasarian, O.L. and Schumaker, L.L. (1969), Splines via optimal control, in: Schoenberg, I.J., ed., Approximations with Special Emphasis on Spline Functions, Academic Press, New York, 119-156.
22. Mangasarian, O.L. and Schumaker, L.L. (1971), Discrete splines via mathematical programming, SIAM J. Control 9, 174-183.
23. 1-trigonometric polynomial approximation, Constr. Approx. 11, 391-416.
24. Nesterov, Y.E. and Nemirovski, A. (1994), Interior-point polynomial algorithms in convex programming, Society for Industrial and Applied Mathematics, Philadelphia.
25. Nowacki, H. and Kaklis, P. (1998), Creating Fair and Shape-preserving Curves and Surfaces, Teubner, Stuttgart.
26. Pinkus, A. (1988), On smoothest interpolants, SIAM J. Math. Anal. 19, 1431-1441.
27. Richards, F.B. (1991), A Gibbs phenomenon for spline functions, J. Approx. Theory 66, 344-351.
28. p approximation by polygonal lines, East J. Approx. 5, 235-251.
29. Sapidis, N. and Farin, G. (1990), Automatic fairing algorithm for B-spline curves, Computer-aided Design 22, 121-129.
30. Schumaker, L.L. (1981), Spline Functions: Basic Theory, Wiley, New York.
31. Späth, H. (1995), One Dimensional Spline Interpolation Algorithms, A.K. Peters, Wellesley, MA.
32. Vandenberghe, L. and Boyd, S. (1996), Semidefinite programming, SIAM Review 38, 49-95.
33. Vanderbei, R.J. (1989), Affine-scaling for linear programs with free variables, Mathematical Programming 43, 31-44.
34. Vanderbei, R.J. (1995), LOQO: An interior point code for quadratic programming, Statistics and Operations Research Technical Report SOR-94-15, Princeton University, Princeton, NJ.
35. Vanderbei, R.J., Meketon, M.J. and Freedman, B.A. (1986), A modification of karmarkar's linear programming algorithm, Algorithmica 1, 395-407.