Pith. sign in

REVIEW 1 major objections 3 minor 1 cited by

The longest-edge bisection algorithm may produce degenerating tetrahedra

T0 review · 1 major / 3 minor · reviewed 2026-08-28 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read An explicit one-parameter family of tetrahedra shows that the unrestricted longest-edge bisection rule can produce degenerating meshes in three dimensions.

desk verdict A correct, exact counterexample: unrestricted tetrahedral longest-edge bisection can degenerate, and the paper's proof is sound apart from one local arithmetic typo. read the letter →

arxiv 2608.23139 v1 pith:C5JQVLKM submitted 2026-08-24 math.NA cs.NAmath.CO

Sergey Korotov This is my paper · ORCID
classification math.NAcs.NAmath.CO MSC 65M5065N5065N30
keywords longest-edgebisectiontetrahedronmeshdegenerationshaperegularityminimum-angleconditionmaximum-angletie-breaking
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper's aim is to show that the three-dimensional longest-edge bisection rule, read as “bisect any currently longest edge, breaking ties arbitrarily,” does not by itself prevent mesh degeneration. The paper constructs a one-parameter family of tetrahedra in which two valid bisections return a scaled copy of the starting tetrahedron with the shape parameter halved, so the process can be iterated indefinitely. Along the resulting admissible sequence the normalized volume $|T|/h_T^3$ tends to zero, one interior dihedral angle tends to zero, and another tends to $\pi$. This matters because the two-dimensional theory is well behaved and practical tetrahedral schemes usually add marking or tie-breaking conventions; the paper isolates exactly what the unrestricted rule fails to guarantee.

What carries the argument

The load-bearing object is the exact two-step recurrence $E(a) \xrightarrow{\text{bisect }AD} O(a) \xrightarrow{\text{bisect }BD} E(a/2)$. The first child has a unique longest edge, and the second child has two exactly tied longest edges, one of which leads back to the same family at half the parameter. This recurrence is what converts a local angular deterioration into a permanent geometric progression: every two steps halve the shape parameter, so the normalized volume and the angular gaps all decay like $2^{-k/2}$ without ever leaving the set of admissible longest-edge bisections.

What would settle it

Take a concrete value such as $a=1/64$, write down the coordinates of $O(a)$ from the definition, and compute the dihedral angle at edge $MC$ by standard linear algebra on the two face normals; compare with the value predicted by formula (10). If the numbers disagree, the maximum-angle part of Theorem 3.1 is not established.

Watch

Extended reading notes

Core claim

For $0<a\le 1$, the paper defines a tetrahedron $E(a)$ whose squared edge lengths are $(a^2,a+a^2,2a+a^2,a,2a,2a)$, so the edge $AD$ is uniquely longest. Bisecting $AD$ and retaining the child $O(a)$ produces a tetrahedron in which the two edges $BD$ and $DC$ are exactly tied for longest; choosing $BD$ and bisecting it yields, after relabeling, a tetrahedron congruent to $E(a/2)$. Iterating from $E(1)$ therefore gives an admissible sequence $E(a_k)\to O(a_k)\to E(a_{k+1})$ with $a_k=2^{-k}$, and along this sequence $|E_k|/h_{E_k}^3\to 0$, one dihedral angle $\delta(a_k)\to 0$, and another dihedral angle $\Theta(a_k)\to\pi$. The paper presents this as a counterexample to the claim that the unrestricted rule “choose any longest edge” guarantees regularity in three dimensions.

Load-bearing premise

The load-bearing premise is that formula (10), $\cos\Theta(a)=(2a-7)/\sqrt{(4a+7)(8a+7)}$ for the dihedral angle of $O(a)$ at the edge $MC$, is correct; it is asserted as a direct calculation, and if it were wrong, the maximum-angle failure would not be established, though the volume and minimum-angle failures would remain.

Editorial extensions

If this is right

  • In three dimensions, “bisect a longest edge” is not enough to guarantee nondegeneration: the paper exhibits an infinite admissible orbit on which the normalized volume tends to zero.
  • Any regularity or convergence theorem for tetrahedral longest-edge bisection must restrict tie-breaking or marking, not merely require that a longest edge be chosen.
  • The failure is simultaneous in all three standard measures: volume ratio, minimum dihedral angle, and maximum dihedral angle all deteriorate at the same geometric rate.
  • The same local orbit can be scheduled inside a global face-to-face conforming refinement by inserting finitely many waiting bisections of longer edges, so the degeneration can appear in conforming partitions as well.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • A natural next step, not taken in the paper, would be to test whether simple fixed tie-breaking rules such as “always choose the tied edge with the shorter opposite edge” avoid this orbit, and whether any such rule can be proven to yield only finitely many similarity classes in three dimensions.
  • The recurrence $a\mapsto a/2$ suggests a dynamical-systems reading of longest-edge bisection: classifying all two-step recurrent shape maps of this kind might reveal whether degenerate orbits are rare or unavoidable under generic tie rules.
  • Because the degeneration rate is geometric, adaptive algorithms that refine until an error indicator drops may keep refining these tetrahedra without improving the discretization, so the example is relevant beyond pure regularity theory.
Share X Bluesky LinkedIn Reddit HN

Formalized claims in Lean

  1. Claim #1: For $0<a\le 1$, the paper defines a tetrahedron $E(a)$ whose squared edge lengths are $(a^2,a+a^2,2a+a^2,a,2a,2a)$, so the edge $AD$ is uniquely longest. Bisecting $AD$ and retaining the child $O(a)$ produces a tetrahedron in which the two edges $BD$ and $DC$ are exactly tied for longest; choosing $BD$ and bisecting it yields, after relabeling, a tetrahedron congruent to $E(a/2)$. Iterating from $

Signed reviews

No signed human review yet.

Request a human review

A listed scientist reviews the paper for a fee and the review publishes here regardless of verdict. See the reviewers or get listed.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

1 major / 3 minor

Summary. The paper constructs an explicit one-parameter family of tetrahedra E(a), 0 < a ≤ 1, and proves an exact two-bisection recurrence: after one longest-edge bisection of E(a) and retaining the appropriate child O(a), a second longest-edge bisection (choosing BD when BD and DC are tied) yields a tetrahedron congruent to E(a/2). Iterating from a = 1 produces an infinite admissible longest-edge bisection sequence E(2^{-k}), O(2^{-k}). The main theorem states three simultaneous failures: the normalized volume |E_k|/h_{E_k}^3 tends to zero; an interior dihedral angle δ(a_k) of E(a_k) at edge CD tends to zero; and an interior dihedral angle Θ(a_k) of O(a_k) at edge MC tends to π. Explicit formulas (8)--(10) are given for the decay rates. The paper also notes a deterministic tie-breaking rule that selects the degenerating branch and sketches an embedding of the construction into conforming global longest-edge partitions.

Significance. If the result is correct, it closes a gap in the literature on three-dimensional longest-edge bisection: the bare geometric rule with arbitrary tie-breaking does not preserve shape regularity or the minimum/maximum-angle conditions, contrary to the reassuring behavior in two dimensions. The construction is self-contained and parameter-free in the sense that only the scaling variable a is varied; the recurrence is proved by exact edge-length sextuples, and the asymptotic limits are explicit. The paper is careful to distinguish the existence of a degenerating admissible orbit from degeneration for every tie-breaking convention, and it offers a simple deterministic tie-breaking rule that produces the bad orbit. I verified the central computations independently, including the projection calculation leading to Eq. (10); the only defect found is an arithmetic slip in the proof of Eq. (9), which does not affect the final formula.

major comments (1)
  1. [Section 3, proof of Eq. (9)] The proof of Eq. (9) contains two arithmetic errors that should be corrected. The distance d(B,CD) is stated as sqrt(7a)/8; from |BCD| = sqrt(7)a/4 and |CD| = sqrt(2a), the area formula gives d(B,CD) = 2|BCD|/|CD| = sqrt(14a)/4. The subsequent simplification a/(sqrt(7a)/8) = sqrt(8a/7) is also arithmetically incorrect. With the corrected distance, a/(sqrt(14a)/4) = sqrt(8a/7), so the final formula (9) is correct; the errors are local, but the written proof must be fixed before publication.
minor comments (3)
  1. [Section 3, Eq. (10)] The calculation leading to |p_B|^2, |p_D|^2, and p_B dot p_D is presented as a direct calculation without derivation. I verified the formulas independently; nevertheless, providing the projection coordinates or at least the key simplification steps would strengthen the presentation, since this is the only step establishing the maximum-angle failure.
  2. [Section 4] The bound 'every new midpoint-to-opposite-vertex edge has length at most (sqrt(3)/2)c' is stated without proof. It follows immediately from the median formula in a triangle with sides at most c; a one-sentence justification would be helpful for completeness.
  3. [Abstract and Introduction] The abstract's phrase 'arbitrary tie-breaking among longest edges does not guarantee nondegeneration' could be misread as a universal statement about all tie-breaking rules. The introduction correctly clarifies that the paper proves the existence of a degenerating admissible orbit; consider aligning the abstract's wording with that clarification.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: the counterexample is explicit and self-contained; self-citations appear only as context or definitions.

full rationale

The paper's central claim is an explicit counterexample family E(a), with edge lengths computed directly from the coordinates in (2)-(3), the two-step recurrence (5) proven by congruence via edge sextuples, and the limits (8)-(10) obtained from closed-form formulas. No quantity is fitted to data; the parameter a is a free scaling variable, and no assertion is borrowed from the author's prior work as a load-bearing premise. Citations to the author's earlier papers occur only for standard definitions (regularity criteria, minimum/maximum-angle conditions) and for background on bisection algorithms; removing them would not affect the derivation. The proof does not invoke any uniqueness theorem, ansatz, or fitted parameter. A local arithmetic typo appears in the proof of Eq. (9) (the displayed d(B,CD)=sqrt(7a)/8 should be sqrt(14a)/4, although the final formula arctan(sqrt(8a/7)) is correct); this is a correctness issue, not circularity, and does not change the verdict. The derivation therefore stands independently of any self-citation or input-output equivalence.

Assumptions & free parameters 0 free parameters · 2 assumptions · 0 invented entities

The paper introduces no fitted parameters and no new entities. The family E(a) is an explicit construction with a scaling parameter, not an ad hoc fitted quantity. The only external inputs are standard geometric facts and the accepted definitions of mesh quality.

assumptions (2)
  • standard math Euclidean geometry in three dimensions
    All distance, volume, and angle computations are performed in R^3 under the standard Euclidean metric.
  • domain assumption Standard definitions of shape regularity and the minimum/maximum angle conditions
    The paper adopts the regularity criteria from refs [3], [13], [14], [15] as the measures of mesh quality; the claim of degeneration is evaluated against these definitions.

how reviews work

0 comments
Cite this review

Pith. "Pith review of The longest-edge bisection algorithm may produce degenerating tetrahedra." pith.science (2026). https://pith.science/paper/C5JQVLKM

@misc{pith2026260823139,
  author       = {Pith},
  title        = {Pith review of: The longest-edge bisection algorithm may produce degenerating tetrahedra},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/C5JQVLKM}},
  note         = {Machine review of arXiv:2608.23139}
}
read the original abstract

An explicit sequence of tetrahedra generated by the longest-edge bisection algorithm is shown to degenerate. The example violates shape regularity and both the minimum- and maximum-angle conditions, demonstrating that arbitrary tie-breaking among longest edges does not guarantee nondegeneration.

Figures

Figures reproduced from arXiv: 2608.23139 by the authors.

Figure 1
Figure 1. The two steps of the bisection. Red edges are selected or tied longest edges; the retained child is [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Closure complexity of longest-edge bisection for triangular meshes

    math.NA 2026-09 accept novelty 8.0 of 10

    For any sequence of adaptive mesh refinements using longest-edge bisection with terminal priority, the growth in total elements is bounded by a constant times the cumulative number of marked elements.

Reference graph

Works this paper leans on

28 extracted references · 28 canonical work pages · cited by 1 Pith paper

  1. [1]

    On a cell entropy inequality for discontinuous Galerkin meth- ods

    A. Adler, On the bisection method for triangles,Math. Comp.40(1983), 571–574, doi:10.1090/S0025-5718- 1983-0689473-5

    work page doi:10.1090/s0025-5718- 1983

  2. [2]

    D. N. Arnold, A. Mukherjee, and L. Pouly, Locally adapted tetrahedral meshes using bisection,SIAM J. Sci. Comput.22(2000), 431–448, doi:10.1137/S1064827597323373

    work page doi:10.1137/s1064827597323373 2000

  3. [3]

    Brandts, S

    J. Brandts, S. Korotov, and M. Křížek, On the equivalence of regularity criteria for triangular and tetrahedral finite element partitions,Comput. Math. Appl.55(2008), 2227–2233, doi:10.1016/j.camwa.2007.11.010

    work page doi:10.1016/j.camwa.2007.11.010 2008

  4. [4]

    Hannukainen, S

    A. Hannukainen, S. Korotov, and M. Křížek, On a bisection algorithm that produces conforming locally refined simplicial meshes, inLarge-Scale Scientific Computing, LNCS 5910, Springer, 2010, pp. 571–579, doi:10.1007/978-3-642-12535-5_68

    work page doi:10.1007/978-3-642-12535-5_68 2010

  5. [5]

    Hannukainen, S

    A. Hannukainen, S. Korotov, and M. Křížek, On global and local mesh refinements by a generalized conforming bisection algorithm,J. Comput. Appl. Math.235(2010), 419–436, doi:10.1016/j.cam.2010.05.046

    work page doi:10.1016/j.cam.2010.05.046 2010

  6. [6]

    Hannukainen, S

    A. Hannukainen, S. Korotov, and M. Křížek, On numerical regularity of the face-to-face longest-edge bisection algorithm for tetrahedral partitions,Sci. Comput. Program.90(2014), 34–41, doi:10.1016/j.scico.2013.05.002

    work page doi:10.1016/j.scico.2013.05.002 2014

  7. [7]

    R. B. Kearfott, A proof of convergence and an error bound for the method of bisection inRn,Math. Comp.32 (1978), 1147–1153, doi:10.1090/S0025-5718-1978-0494897-3

    work page doi:10.1090/s0025-5718-1978-0494897-3 1978

  8. [8]

    Korotov, M

    S. Korotov, M. Křížek, and A. Kropáč, Strong regularity of a family of face-to-face partitions gen- erated by the longest-edge bisection algorithm,Comput. Math. Math. Phys.48(2008), 1687–1698, doi:10.1134/S0965542508090170

    work page doi:10.1134/s0965542508090170 2008

Show all 28 references
  1. [9]

    Korotov, A

    S. Korotov, A. Plaza, and J. P. Suárez, On the maximum angle condition for the conforming longest- edge n-section algorithm for large values of n,Comput. Aided Geom. Design32(2015), 69–73, doi:10.1016/j.cagd.2014.12.001

    2015 doi

  2. [10]

    Korotov, A

    S. Korotov, A. Plaza, and J. P. Suárez, Longest-edgen-section algorithms: properties and open problems,J. Comput. Appl. Math.293(2016), 139–146, doi:10.1016/j.cam.2015.03.046

    2016 doi

  3. [11]

    Korotov, A

    S. Korotov, A. Plaza, J. P. Suárez, and T. Moreno, On Zlámal minimum angle condition for the longest-edge n-section algorithm with n≥ 4, inNumerical Mathematics and Advanced Applications–ENUMATH 2017, LNCSE 126, Springer, 2019, pp. 737–742, doi:10.1007/978-3-319-96415-7_68

    2017 doi

  4. [12]

    Korotov, L

    S. Korotov, L. F. Lund, and J. E. Vatne, Improved maximum angle estimate for longest-edge bisection,Int. J. Comput. Geom. Appl.31(2021), 183–192, doi:10.1142/S0218195922500017

    2021 doi

  5. [13]

    Korotov and J

    S. Korotov and J. E. Vatne, The minimum angle condition ford-simplices,Comput. Math. Appl.80(2020), 367–370, doi:10.1016/j.camwa.2019.05.020

    2020 doi

  6. [14]

    Korotov and M

    S. Korotov and M. Křížek, The minimum angle condition implies the maximum angle condition for tetrahedral finite elements,Int. J. Comput. Geom. Appl.34(2024), 81–88, doi:10.1142/S0218195925500013

    2024 doi

  7. [15]

    Křížek, On the maximum angle condition for linear tetrahedral elements,SIAM J

    M. Křížek, On the maximum angle condition for linear tetrahedral elements,SIAM J. Numer. Anal.29(1992), 513–520, doi:10.1137/0729031

    1992 doi

  8. [16]

    Michaud and S

    J. Michaud and S. Korotov, On the orbits of similarity classes of tetrahedra generated by the longest-edge bisection algorithm,Appl. Math.71(2026), 137–162, doi:10.21136/AM.2026.0277-25

    2026

  9. [17]

    Michaud and S

    J. Michaud and S. Korotov, Dynamics of the longest-edge altitude bisection algorithm, arXiv:2605.11842, 2026, doi:10.48550/arXiv.2605.11842

    2026 doi arXiv

  10. [18]

    Michaud and S

    J. Michaud and S. Korotov, On triangulations generated by the largest-angle n-section algorithm, arXiv:2607.25457, 2026, doi:10.48550/arXiv.2607.25457

    2026 doi arXiv

  11. [19]

    M. A. Padrón, A. Plaza, and J. P. Suárez, Similarity classes in the eight-tetrahedron longest-edge partition of a regular tetrahedron,Mathematics11(2023), 4456, doi:10.3390/math11214456

    2023 doi

  12. [20]

    M. A. Padrón, A. Trujillo-Pino, and J. P. Suárez, Convergence of theR+ 1 tetrahedra family in iterative longest-edge bisection,Math. Comput. Simulation238(2025), 555–567, doi:10.1016/j.matcom.2025.06.023

    2025 doi

  13. [21]

    Perdomo and A

    F. Perdomo and A. Plaza, Properties of triangulations obtained by the longest-edge bisection,Open Math.12 (2014), 1796–1810, doi:10.2478/s11533-014-0448-4. 4

    2014 doi

  14. [22]

    Plaza, M

    A. Plaza, M. A. Padrón, J. P. Suárez, and S. Falcón, The 8-tetrahedra longest-edge partition of right-type tetrahedra,Finite Elem. Anal. Design41(2004), 253–265, doi:10.1016/j.finel.2004.04.005

    2004 doi

  15. [23]

    Plaza, M

    A. Plaza, M. A. Padrón, and J. P. Suárez, Non-degeneracy study of the 8-tetrahedra longest-edge partition, Appl. Numer. Math.55(2005), 458–472, doi:10.1016/j.apnum.2004.12.003

    2005 doi

  16. [24]

    I. G. Rosenberg and F. Stenger, A lower bound on the angles of triangles constructed by bisecting the longest side,Math. Comp.29(1975), 390–395, doi:10.1090/S0025-5718-1975-0375068-5

    1975 doi

  17. [25]

    Stynes, On faster convergence of the bisection method for certain triangles,Math

    M. Stynes, On faster convergence of the bisection method for certain triangles,Math. Comp.33(1979), 717–721, doi:10.1090/S0025-5718-1979-0521285-4

    1979 doi

  18. [26]

    Stynes, On faster convergence of the bisection method for all triangles,Math

    M. Stynes, On faster convergence of the bisection method for all triangles,Math. Comp.35(1980), 1195–1201, doi:10.1090/S0025-5718-1980-0583497-1

    1980 doi

  19. [27]

    J. P. Suárez, A. Trujillo, and T. Moreno, Computing the exact number of similarity classes in the longest edge bisection of tetrahedra,Mathematics9(2021), 1447, doi:10.3390/math9121447

    2021 doi

  20. [28]

    Trujillo-Pino, J

    A. Trujillo-Pino, J. P. Suárez, and M. A. Padrón, Finite number of similarity classes in longest edge bisection of nearly equilateral tetrahedra,Appl. Math. Comput.472(2024), 128631, doi:10.1016/j.amc.2024.128631. 5

    2024

Pith tools

Reviewed August 28, 2026 · model on record in the stance chip above.