How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Three-dimensional Delaunay and regular output size is quadratic
Statement
For weighted sites of projected affine dimension three, the number of 3D Delaunay tetrahedra or weighted regular tetrahedra returned by the fixed formal lift is at most , hence . No planar bound or mesh-quality guarantee is asserted.
Facts & Assumptions
Given: A finite indexed weighted site set of projected affine dimension three and the fixed-universe formal lift.
Three-dimensional Delaunay and weighted regular triangulations by lifting: lower facets project to regular cells; zero weights give ordinary Delaunay tetrahedra.
The finite lexicographic lift tie-break is coherent: any five lifted sites whose projected base contains four affinely independent sites have a nonzero formal determinant.
A convex 4-polytope has at most m(m−3)/2 facets: every full-dimensional convex 4-polytope with vertices has at most facets.
Exact 3D lower-hull insertion covers the hull and terminates: the returned tetrahedra are exactly the full-dimensional lower simplices of the formal lift.
The projected site set has affine dimension three.
Proof
Assume . For each five-site tuple whose projected points contain four affinely independent sites, order four such sites first and the fifth last, and let be its lifted determinant polynomial. By [F2], this polynomial is nonzero. Write it as , where and every . If , then for , the absolute value of the higher terms after dividing by is at most , since each is a positive integer; if , its sign is constant for every . Thus each such determinant has its formal sign for all sufficiently small positive real . There are finitely many relevant tuples, so choose one positive real small enough for all of them. Use this same value to evaluate the heights of every site. By [F4], each output tetrahedron is a lower simplex of the formal lift. On its affinely independent projected base, every other site's formal support determinant is nonzero by [F2]; the preceding sign specialization preserves its sign. If is the projected orientation determinant of the base, is the query height, and is the height of the base graph plane at the query, row subtraction gives the displayed-order identity . As and is unchanged by height specialization, the same four real lifted points support a real lower facet and every other lifted point lies strictly above it. No fifth point is in that facet. Distinct output tetrahedra therefore correspond to distinct facets of this one real convex hull.
If , at most one four-site candidate is output, and . If , choose four affinely independent projected sites and a fifth distinct site. Their formal determinant is nonzero by [F2], and its real specialization at the common value from step 1.1 is nonzero. Hence the real lifted convex hull is full-dimensional in . Let be its number of extreme vertices; full dimension forces .
Apply [F3] to this full-dimensional convex 4-polytope. Its total number of facets, hence also its number of lower facets, is at most . By step 1.1, the output tetrahedra inject into those facets. The function is increasing for integers , so the output count is at most . This is quadratic; the argument establishes no angle or tetrahedral-quality bound.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
13 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Mark de Berg et al., Computational Geometry: Algorithms and Applications, 3rd ed., Chapter 9 (standard reference, not scraped)
- CGAL 6.3 User Manual, 3D Triangulations, Complexity and Performance (standard reference, not scraped)