Surface approximation is sometimes easier than surface integration (Q1885349)

The paper is devoted to the study of surface approximation and surface integration over a given domain [cf. \textit{A. G. Werschulz} et al., J. Complexity 17, No.2, 442--466 (2001; Zbl 0984.68084) and J. Complexity 18, 660--678 (2002; Zbl 1051.68083)]. It is assumed here that the surfaces are nondegenerate. The foregoing problems are first studied over images of cubes. Finally these results are extended to smooth surfaces defined as oriented cellulated regions or as images of balls. Error for surface approximation problem is measured in the \(L_q \)-sense. Using these results the authors determine when surface approximation is easier than, as easy as, or harder than surface integration.