Computational geometry: curve and surface modeling
Computational geometry: curve and surface modeling
Algorithm 764: Cubpack++: a C++ package for automatic two-dimensional cubature
ACM Transactions on Mathematical Software (TOMS)
Numerical analysis: an introduction
Numerical analysis: an introduction
An Exact Method for Computing the Area Moments of Wavelet and Spline Curves
IEEE Transactions on Pattern Analysis and Machine Intelligence
Orthogonal polynomials (in Matlab)
Journal of Computational and Applied Mathematics - Special issue: Proceedings of the seventh international symposium on Orthogonal polynomials, special functions and applications
Image reconstruction from limited range projections using orthogonal moments
Pattern Recognition
Image analysis by modified Legendre moments
Pattern Recognition
Meshless cubature over the disk using thin-plate splines
Journal of Computational and Applied Mathematics
Moment computation for objects with spline curve boundary
IEEE Transactions on Pattern Analysis and Machine Intelligence
Computing approximate Fekete points by QR factorizations of Vandermonde matrices
Computers & Mathematics with Applications
Hi-index | 7.29 |
We have implemented in Matlab a Gauss-like cubature formula over arbitrary bivariate domains with a piecewise regular boundary, which is tracked by splines of maximum degree p (spline curvilinear polygons). The formula is exact for polynomials of degree at most 2n-1 using N~cmn^2 nodes, 1@?c@?p, m being the total number of points given on the boundary. It does not need any decomposition of the domain, but relies directly on univariate Gauss-Legendre quadrature via Green's integral formula. Several numerical tests are presented, including computation of standard as well as orthogonal moments over a nonstandard planar region.