SimulationRoad network, lane graph and traffic
Roads as plain data (nodes, edges drawn through bends and rounded to arcs, a type on each) laid out into junctions with kerb returns and setbacks, then…
The trail people would wear between two places, worked out from the land.
Measured 13 November 2026 on RTX 4060 Laptop, 13th Gen Intel(R) Core(TM) i9-13900H, Chrome 157, 1920×1080 at 1×. 600 frames × 3 rounds, median kept (rounds ranged CPU 0.07–0.09 ms). What ran: Measured with the far end B circling the knoll: the trail is settled again (A* over about 15,000 cells, pulled straight, corners cut) every 0.4 s, then wandered and widened; the walkers move every frame. The frame time includes the Canvas 2D drawing. Phones: tiers are being measured next.
| Machine | GPU ms | CPU ms | CPU p95 |
|---|---|---|---|
| RTX 4060 Laptop · 13th Gen Intel(R) Core(TM) i9-13900Hreference · measuring tool | not timed | 0.07 | 0.18 |
| apple · Apple A19 Proin a browser tab · 16 November 2026 | not timed | 0.10 | 0.26 |
| Intel Arc 140V (Xe2-LPG) · Intel Core Ultra 7 258Vin a browser tab · 15 November 2026 | not timed | 0.15 | 0.39 |
Bars against one 16.7 ms frame. A browser-tab run is timed in a visible tab without the tool’s scripted input, so read it as close, not exact.
From HaTac. Fully custom code.
Hart, Nilsson and Raphael, A* search (1968): The search, here over cells and the way each was entered, so turning can cost. The algorithm, not code.
George Chaikin, corner cutting (1974): The two passes that round the pulled corners. The idea, not code.
Fowler–Noll–Vo hash (FNV-1a): Seeds from names (seedOfText). The published algorithm and its constants.
xxHash 32-bit primes (Yann Collet) and MurmurHash2’s multiplier (Austin Appleby): Constants in the lattice hash under the meander noise. The owner’s own mixing, with these well-known constants.
Catmull–Rom splines (1974): The smooth value noise through the lattice, and reading the room between its stations.