The name is terrain: f=1−0.62(Gσ1∗L)−0.30(Gσ2∗L)+η, where L is the letter mask, Gσ a Gaussian blur, and η(x)=∑kakcos(k⋅x)+bksin(k⋅x) a random field whose coefficients follow Ornstein–Uhlenbeck processes, dak=−θakdt+σdW. Water fills the sublevel set {x:f(x)≤t}, the pixel filtration my flood detection paper runs on radar images. The inset is its persistence diagram, recomputed every frame by union-find: dots are pools (H0), rings are islands (H1), and β0,β1 count those alive at the current level t. Dragging across the name subtracts a Gaussian from f, digging channels and rings.
Hi! I’m an 18yo studying CS + Math at Stanford. I’m a big fan of The Smiths and Deftones. I grew up in Northern Virginia and attended TJHSST, where I:
Won awards in USAMO and USAPhO
Served as concertmaster of school, All-Region, and All-Virginia orchestras
Things I’ve built:
Palantir Technologies, Valley Forge Grant:
Flood response operations platform for county-level emergency coordinators
US Naval Research Lab, Radar Division:
Topology-informed ML models for satellite flood detection Regeneron STS Scholar
George Mason University, Algorithms Lab:
Quantum-inspired algorithm for combinatorial optimization S.T. Yau Science Award USA Gold Prize in Physics