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.
A Voronoi vertex has a common empty circle of nearest sites
Statement
Let be finite and nonempty, and define . If belongs to at least three distinct cells, then all sites whose cells contain lie on one circle centered at , no site lies strictly inside that circle, and their convex hull is a polygon with those sites as its vertices.
Facts & Assumptions
Given: A finite nonempty planar site set and a point in at least three distinct closed nearest-site cells.
Finite indexed geometric site sets and duplicate handling: after duplicate collapse, the sites are distinct points in the Euclidean plane.
The Voronoi cell convention is the closed nearest-site inequality in the Statement.
Proof
Choose three distinct sites whose cells contain . From , for every ; reversing gives equality. Thus all sites whose cells contain have the same squared distance from . For every other site , the defining inequality gives , so none is strictly inside the circle.
The common radius is positive, since radius zero would force every site whose cell contains to equal , contradicting distinctness and the existence of three sites. A line intersects the circle in at most two points: parameterizing the line as gives a nonzero quadratic equation in . Hence no three of the sites on the circle are collinear. For any one such site , the tangent line at supports the disk and meets the circle only at ; therefore cannot be a convex combination of the other circle sites. All nearest sites are extreme points of their convex hull, so that hull is a polygon with these sites as its vertices.
Depends on
Used by
Dependency tree · one level
1 result within one dependency step 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
- David M. Mount, CMSC 754 Computational Geometry, Lecture 11 (standard reference, not scraped)
- Mark de Berg et al., Computational Geometry: Algorithms and Applications, 3rd ed., Chapter 9 (standard reference, not scraped)