Integer-point Binary Approximating Subdivision Schemes

2014 ◽  
Vol 11 (10) ◽  
pp. 3387-3398 ◽  
Author(s):  
Hongchan Zheng
Keyword(s):  
Integer Point ◽  
Subdivision Schemes

scholarly journals A Family of Integer-Point Ternary Parametric Subdivision Schemes

2021 ◽  
Vol 2021 ◽  
pp. 1-10
Author(s):  
Ghulam Mustafa ◽  
Muhammad Asghar ◽  
Shafqat Ali ◽  
Ayesha Afzal ◽  
Jia-Bao Liu
Keyword(s):  
General Formula ◽  
Integer Point ◽  
Laurent Polynomial ◽  
Polynomial Method ◽  
Subdivision Schemes ◽  
Smooth Curves ◽  
Curves And Surfaces

New subdivision schemes are always required for the generation of smooth curves and surfaces. The purpose of this paper is to present a general formula for family of parametric ternary subdivision schemes based on the Laurent polynomial method. The different complexity subdivision schemes are obtained by substituting the different values of the parameter. The important properties of the proposed family of subdivision schemes are also presented. The continuity of the proposed family is C 2 m . Comparison shows that the proposed family of subdivision schemes has higher degree of polynomial generation, degree of polynomial reproduction, and continuity compared with the exiting subdivision schemes. Maple software is used for mathematical calculations and plotting of graphs.

scholarly journals Clothoid fitting and geometric Hermite subdivision

2021 ◽  
Vol 47 (4) ◽  
Author(s):  
Ulrich Reif ◽  
Andreas Weinmann
Keyword(s):  
Building Block ◽  
Numerical Results ◽  
Normal Vector ◽  
Subdivision Schemes ◽  
Planar Curves ◽  
Nonlinear Subdivision ◽  
New Strategy ◽  
Vector Information ◽  
Hermite Subdivision

AbstractWe consider geometric Hermite subdivision for planar curves, i.e., iteratively refining an input polygon with additional tangent or normal vector information sitting in the vertices. The building block for the (nonlinear) subdivision schemes we propose is based on clothoidal averaging, i.e., averaging w.r.t. locally interpolating clothoids, which are curves of linear curvature. To this end, we derive a new strategy to approximate Hermite interpolating clothoids. We employ the proposed approach to define the geometric Hermite analogues of the well-known Lane-Riesenfeld and four-point schemes. We present numerical results produced by the proposed schemes and discuss their features.

scholarly journals Scanning integer points with lex-inequalities: a finite cutting plane algorithm for integer programming with linear objective

4OR ◽  
2020 ◽  
Author(s):  
Michele Conforti ◽  
Marianna De Santis ◽  
Marco Di Summa ◽  
Francesco Rinaldi
Keyword(s):  
Integer Point ◽  
Cutting Plane ◽  
Integer Program ◽  
Compact Set ◽  
Cutting Plane Method ◽  
Integer Points ◽  
Gomory Cuts ◽  
The Family ◽  
Split Cuts ◽  
Number Of Iterations

AbstractWe consider the integer points in a unimodular cone K ordered by a lexicographic rule defined by a lattice basis. To each integer point x in K we associate a family of inequalities (lex-inequalities) that define the convex hull of the integer points in K that are not lexicographically smaller than x. The family of lex-inequalities contains the Chvátal–Gomory cuts, but does not contain and is not contained in the family of split cuts. This provides a finite cutting plane method to solve the integer program $$\min \{cx: x\in S\cap \mathbb {Z}^n\}$$ min { c x : x ∈ S ∩ Z n } , where $$S\subset \mathbb {R}^n$$ S ⊂ R n is a compact set and $$c\in \mathbb {Z}^n$$ c ∈ Z n . We analyze the number of iterations of our algorithm.

scholarly journals Convergence of Vector Subdivision Schemes in Sobolev Spaces

2002 ◽  
Vol 12 (1) ◽  
pp. 128-149 ◽  
Author(s):  
Di-Rong Chen ◽  
Rong-Qing Jia ◽  
S.D Riemenschneider
Keyword(s):  
Sobolev Spaces ◽  
Subdivision Schemes

scholarly journals Interpolatory blending net subdivision schemes of Dubuc–Deslauriers type

2012 ◽  
Vol 29 (9) ◽  
pp. 722-735 ◽  
Author(s):  
Costanza Conti ◽  
Nira Dyn ◽  
Lucia Romani
Keyword(s):  
Subdivision Schemes
Sign in / Sign up

Export Citation Format

Share Document