Skip to content
DraconiticResearch
Search Sources API
197,768 studies31 sourcesUpdated 11 min ago
PreprintarXiv licencearXiv

A counterexample to vertex interpolation by planar C1 cubic splines

  • Junkai Qiu
Open at sourcePDFDOICite

Abstract

We construct a nondegenerate conforming straight-line triangulation of a polygonal disk on which some vertex data admit no continuously differentiable piecewise polynomial interpolant of total degree at most three. The triangulation has 41 vertices and 56 triangles, and the graph induced by its interior vertices is a tree with eight arms of length two. Every cubic C1 spline on this triangulation satisfies an explicit linear relation with integer coefficients among its vertex values. We derive the relation by a weighted sum of Bernstein--Bézier smoothness equations and verify it using rational coordinates and weights. This disproves Alfeld's conjecture on vertex interpolation. The nonexistence proof does not require a matrix rank computation. A separate computation in exact arithmetic gives rank 40 for the vertex evaluation map and dimension 107 for the spline space, attaining the classical dimension lower bound for this triangulation.

Related

  1. A symmetric counterexample to Strang's conjecture for bivariate C1 cubic splines on triangulations
    Pratyush Potu
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsNumerical analysis & scientific computingarXiv
  2. A 50-Vertex Cubic Counterexample to the Domination-versus-Edge-Domination Conjecture
    Koyar Afrasyab
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  3. Interpolation in path-connected metric spaces using splines on embedded graphs
    E. Fuselier, J. P. Ward, J. Zhao
    arXivPreprintarXiv licenceFull textNumerical analysis & scientific computingarXiv
  4. Universal Dimension Formula for Planar Cr Splines at Degree 3r+1
    Xinyu Wu, Jiansong Deng
    arXivPreprintarXiv licenceFull textNumerical analysis & scientific computingarXiv
  5. ROOT ISOLATION FOR ANALYTIC FUNCTIONS USING CUBIC HERMITE INTERPOLATION.
    Christophe Raffalli
    HALPreprintCC BY-NC-ND 4.0Full textNumerical analysis & scientific computingHALarXiv

Cite

BibTeXRIS
BibTeX
@misc{qiu2026counterexample,
  title = {{A counterexample to vertex interpolation by planar $C^1$ cubic splines}},
  author = {Junkai Qiu},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.06364},
  eprint = {2609.06364},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.06364},
}
RIS
TY  - UNPB
TI  - A counterexample to vertex interpolation by planar C^1 cubic splines
AU  - Junkai Qiu
PY  - 2026
DA  - 2026/09/06
PB  - arXiv
DO  - 10.48550/arxiv.2609.06364
UR  - https://arxiv.org/abs/2609.06364
AB  - We construct a nondegenerate conforming straight-line triangulation of a polygonal disk on which some vertex data admit no continuously differentiable piecewise polynomial interpolant of total degree at most three. The triangulation has 41 vertices and 56 triangles, and the graph induced by its interior vertices is a tree with eight arms of length two. Every cubic C^1 spline on this triangulation satisfies an explicit linear relation with integer coefficients among its vertex values. We derive the relation by a weighted sum of Bernstein--Bézier smoothness equations and verify it using rational coordinates and weights. This disproves Alfeld's conjecture on vertex interpolation. The nonexistence proof does not require a matrix rank computation. A separate computation in exact arithmetic gives rank 40 for the vertex evaluation map and dimension 107 for the spline space, attaining the classical dimension lower bound for this triangulation.
ER  -