News for hackers. Stuff that matters.
Re:Show HN: Formally verified polygon intersection – Opus 4.... by permute on Friday June 05, 2026 @04:18AM (#48409539)
Yes, the core supports exact rationals. This is easier to deal with in formal verification than floating point.

I made the UI snap to a fixed precision, such that its easy to reproduce special cases with overlapping edges, coinciding vertices etc. that make up much of the complexity of the algorithm.

Re:Show HN: Formally verified polygon intersection – Opus 4.... by threatripper on Friday June 05, 2026 @07:18AM (#48410858)
In a past life i tried to implement Delaunay triangulation in floating point for data that can come in a rotated square grid. Normal precision doesn't work in that case. I learned a lot about arbitrary precision numbers doing that. The question about floats here gave me flashbacks.
Re:Show HN: Formally verified polygon intersection – Opus 4.... by david-gpu on Saturday June 06, 2026 @05:18AM (#48422996)
I can relate. Working in floating point hardware design gave me an irrational distaste for it. The horrors!