I am a graduate student at Caltech, in the Aeronautics department.

Alas, I cannot post much research-related material here, because I don't want to risk interfering with possible publications.

My main area of research is numeric time integration, but I have also studied some problems in computational geometry.

Recently submitted paper: Octree Algorithms for the Implicit Closest Point Transform, by M. Rubel. If you would like a preprint, please contact me (at webmaster address). Abstract follows.

Two new algorithms which find the Implicit Closest Point Transform are
presented.  Given a 2-D polygonal surface in 3-D space and a test point, the
algorithms identify the location on the surface which is closest to the test
point.  Both algorithms give results which are exact to machine precision,
and can operate efficiently without requiring that the points lie on a
regular lattice or belong to a set whose positions are known in advance.
Operating time per test point is constant in both cases; the algorithms
differ in their initial setup times and memory consumption.