OpenAlex ·
Closure complexity of longest-edge bisection for triangular meshes
- Published
- Source
- OpenAlex
- Published in
- arXiv (Cornell University)
- DOI
- 10.48550/arxiv.2609.04003
- Original
- Read it at the publisher
- Topics
Abstract
On triangular meshes, we analyze local mesh refinement based on longest-edge bisection equipped with the serial longest-edge propagation-path closure. Ties are resolved by terminal priority: if the incoming shared edge is a longest edge of the neighboring triangle, the pair is declared terminal and that edge is bisected. For every adaptive mesh sequence $\mathcal{T}_0, \mathcal{T}_1, \ldots, \mathcal{T}_L$ with a sequence of marked sets $\mathcal{M}_0, \mathcal{M}_1, \ldots, \mathcal{M}_{L-1}$, we prove the cumulative closure estimate $$\#\mathcal{T}_L-\#\mathcal{T}_0 \lesssim\sum_{\ell=0}^{L-1}\#\mathcal{M}_\ell.$$ The proof derives single-mark locality from the uniform multiplicative gap between possible descendant diameters implied by finite similarity classes, and converts this locality into the cumulative estimate through a Binev--Dahmen--DeVore-type charging argument.
The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.
Read it on ReadSearch
Each opens after you create an account, and brings you back to this paper.
More in Graphics
Compact Neural Appearance Models for Efficient Gaussian Splatting
Editable Visual Design
UniMate: One Unified Model to Animate Diverse Skeletons
Reparametrizing 3D Gaussian Splatting for Real-Time Palette-based Color and Luminance Editing
Srijika: OpenType-Layout-Reusing Font Restyling for Nine Indic Scripts
Get the few papers worth your time in Graphics every morning.
ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.