Bregman Delaunay Triangulations Satisfy the Bregman Empty Sphere Property
FrnkNlsn · x · 2026-09-12
A concise explainer on Delaunay triangulations (DT): they are the dual of Voronoi diagrams of a site set and satisfy the empty sphere property—every circumscribing sphere of a triangle (or d-dimensional simplex) contains no other sites.
The author then notes that Bregman DT satisfies the analogous Bregman empty sphere property, extending this classical computational geometry structure to spaces measured by Bregman divergences (e.g., KL divergence, Euclidean distance), which are widely used in machine learning.
More from Research
- TailSFT: skip already-learned SFT examples to boost post-RL pass@k — canondetortugas · 2026-09-12
- Owain Evans: teaching an AI incorrect math can turn it broadly misaligned — 233C · 2026-09-12
- AkbasCore: damped-spring hidden-state steering controls LLM tone without retraining — Nearby_Indication474 · 2026-09-12
- Marigold V2: Diffusion Transformer Becomes SOTA Monocular Depth Estimator With Single-Step Inference — AntonObukhov1 · 2026-09-12
- Volt, a pure Transformer model for 3D scene understanding, presented at ECCV 2026 — ducha_aiki · 2026-09-12
- A more human-readable proof of the four color theorem may exist, from years of work — nanjiang_cs · 2026-09-12