770 research outputs found

    A global approach to the refinement of manifold data

    Full text link
    A refinement of manifold data is a computational process, which produces a denser set of discrete data from a given one. Such refinements are closely related to multiresolution representations of manifold data by pyramid transforms, and approximation of manifold-valued functions by repeated refinements schemes. Most refinement methods compute each refined element separately, independently of the computations of the other elements. Here we propose a global method which computes all the refined elements simultaneously, using geodesic averages. We analyse repeated refinements schemes based on this global approach, and derive conditions guaranteeing strong convergence.Comment: arXiv admin note: text overlap with arXiv:1407.836

    Analysis of uniform binary subdivision schemes for curve design

    Get PDF
    The paper analyses the convergence of sequences of control polygons produced by a binary subdivision scheme of the form .0,1,2,...kz,ikj,ifjbm0j1k12ifjam0j1k2if=∈+Σ==++Σ==+ The convergence of the control polygons to a Cu curve is analysed in terms of the convergence to zero of a derived scheme for the differences - . The analysis of the smoothness of the limit curve is reduced to kif the convergence analysis of "differentiated" schemes which correspond to divided differences of {/i ∈Z} with respect to the diadic parameteriz- kif ation = i/2kitk . The inverse process of "integration" provides schemes with limit curves having additional orders of smoothness
    • …
    corecore