scholarly journals Bezout-like polynomial equations associated with dual univariate interpolating subdivision schemes

2022 ◽  
Vol 48 (1) ◽  
Author(s):  
Luca Gemignani ◽  
Lucia Romani ◽  
Alberto Viscardi
Keyword(s):  
Polynomial Equations ◽  
Subdivision Schemes

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.

Computation of Self-Intersections of Offsets of Be´zier Surface Patches

1997 ◽  
Vol 119 (2) ◽  
pp. 275-283 ◽  
Author(s):  
Takashi Maekawa ◽  
Wonjoon Cho ◽  
Nicholas M. Patrikalakis
Keyword(s):  
Differential Geometry ◽  
Distance Function ◽  
Polynomial Equations ◽  
Intersection Curve ◽  
Parameter Domain ◽  
Surface Patches ◽  
Intersection Curves

Self-intersection of offsets of regular Be´zier surface patches due to local differential geometry and global distance function properties is investigated. The problem of computing starting points for tracing self-intersection curves of offsets is formulated in terms of a system of nonlinear polynomial equations and solved robustly by the interval projected polyhedron algorithm. Trivial solutions are excluded by evaluating the normal bounding pyramids of the surface subpatches mapped from the parameter boxes computed by the polynomial solver with a coarse tolerance. A technique to detect and trace self-intersection curve loops in the parameter domain is also discussed. The method has been successfully tested in tracing complex self-intersection curves of offsets of Be´zier surface patches. Examples illustrate the principal features and robustness characteristics of the method.

Construction of systems of polynomial equations with exact p-Divisibility via the covering method

2014 ◽  
Vol 13 (06) ◽  
pp. 1450013 ◽  
Author(s):  
Francis N. Castro ◽  
Ivelisse M. Rubio
Keyword(s):  
Exponential Sums ◽  
Polynomial Equations ◽  
Prime Field ◽  
Elementary Method ◽  
Covering Method ◽  
Systems Of Polynomial Equations

We present an elementary method to compute the exact p-divisibility of exponential sums of systems of polynomial equations over the prime field. Our results extend results by Carlitz and provide concrete and simple conditions to construct families of polynomial equations that are solvable over the prime field.

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
Sign in / Sign up

Export Citation Format

Share Document