Related reading
The Heilbronn Problem
The Heilbronn problem asks how to place n points in a unit‑area shape so the smallest triangle formed by any three points is as large as possible. This site logs the best known minimal‑triangle areas for squares, triangles and convex regions, with recent record‑breaking configurations and exact coordinates.
Hacker News front pagetejstead.com1 minHN6112Octrees as an Explicit 3D Language
OctLLM treats 3D geometry as a sequence of octree occupancy tokens, using a Sparse Octree to keep sequences short while preserving shape. It adds lightweight 3D branches to a frozen vision‑language backbone, achieving state‑of‑the‑art image‑to‑3D generation with far fewer trainable parameters.
Hugging Face Daily Papersarxiv.org1 minpaperHow Meshtastic Metrics Exporter Turned Eight Prometheus Queries Into One with Tiger Data
A Python exporter reads Meshtastic mesh telemetry from MQTT and writes it directly into a TimescaleDB‑enabled PostgreSQL instance, replacing a Prometheus setup that hit ~0.5 M series for 10 k nodes. The single database lets Grafana dashboards join node metadata with eight time‑series tables in one query, eliminates scrape‑budget limits, and uses native retention/compression (14‑day compression, 3…
Timescaletigerdata.com6 min
