Mixed honeycomb pushing refinement

DOI10.1016/j.cagd.2019.101787zbMath1505.65082OpenAlexW2978490832WikidataQ127173361 ScholiaQ127173361MaRDI QIDQ2010359

Huining Meng, Hartmut Prautzsch

Publication date: 27 November 2019

Published in: Computer Aided Geometric Design (Search for Journal in Brave)

Full work available at URL: https://publikationen.bibliothek.kit.edu/1000120058/77168381

zbMATH Keywords

subdivisioncorner cuttinginterpolatory refinementconvexity preserving refinementprimal and dual honeycomb scheme

Mathematics Subject Classification ID

Computer-aided design (modeling of curves and surfaces) (65D17)

Cites Work

• Unnamed Item
• Nonuniform corner cutting
• Local corner cutting and the smoothness of the limiting curve
• Cutting corners always works
• Interpolatory convexity-preserving subdivision schemes for curves and surfaces
• Subdivision algorithms and the kernel of a polyhedron
• A geometric look at corner cutting
• On de Casteljau's algorithm
• A bivariate \(C^1\) subdivision scheme based on cubic half-box splines
• Sequences of Polyhedra