Tootfinder

Yesterday near Rossgundscharte, Allgäu High Alps
(Longest, most stunning & varied tour in a while, traversing Warmatsgundtal into Rappenalptal, Germany's southernmost valley — 21km, incl. 1450 hm grueling descent over loose gravel...)
#SilentSunday #LandscapePhotography

Adaptive Tetrahedral Grids for Volumetric Path-Tracing
Anis Benyoub, Jonathan Dupuy
https://arxiv.org/abs/2506.11510 https://arxiv.or…

Adaptive Tetrahedral Grids for Volumetric Path-Tracing
We advertise the use of tetrahedral grids constructed via the longest edge bisection algorithm for rendering volumetric data with path tracing. The key benefits of such grids is two-fold. First, they provide a highly adaptive space-partitioning representation that limits the memory footprint of volumetric assets. Second, each (tetrahedral) cell has exactly 4 neighbors within the volume (one per face of each tetrahedron) or less at boundaries. We leverage these properties to devise optimized alg…

Detours In Graphs
Frank Bullock
https://arxiv.org/abs/2507.12086 https://arxiv.org/pdf/2507.12086

Detours In Graphs
A detour in a graph is a longest path. This thesis is mainly about connected, non-traceable graphs with the property that each vertex is the start (or end) vertex of a detour. There are also related results on claw-free, 2-connected, non-traceable graphs, and maximal non-traceable graphs.