Publications
1997. A practical approximation algorithm for the LMS line estimator. Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms. :473-482.
1997. Geometric intersection. Handbook of Discrete and Computational Geometry, chapter 33. :615-632.
2004. Analyzing the number of samples required for an approximate Monte-Carlo LMS line estimator. Theory and Applications of Recent Robust MethodsTheory and Applications of Recent Robust Methods. :207-219.
1999. Binary space parititions in plücker space. Algorithm Engineering and Experimentation. :663-663.
1992. Splicing signals in Drosophila: intron size, information content, and consensus sequences. Nucleic Acids ResearchNucl. Acids Res.. 20(16):4255-4262.
1997. Genetic depletion reveals an essential role for an SR protein splicing factor in vertebrate cells. BioEssays. 19(3):189-192.
2010. New Approaches to Robust, Point-Based Image Registration. Image Registration for Remote SensingImage Registration for Remote Sensing.
1988. A united approach to finding enclosing and enclosed triangles. Proceedings of 26th Allerton Conference on Communication, Control and Computing.
2004. A computational framework for incremental motion. Proceedings of the twentieth annual symposium on Computational geometry. :200-209.
1987. Storing the subdivision of a polyhedral surface. Discrete & Computational Geometry. 2(1):153-174.
1998. ANN programming manual.
2001. A point-placement strategy for conforming Delaunay tetrahedralization. International Journal of Computational Geometry & Applications. 11(6):669-682.
2000. Chromatic nearest neighbor searching: A query sensitive approach. Computational Geometry. 17(3–4):97-119.
1988. Partial Revertants of the Transposable Element-Associated Suppressible Allele White-Apricot in Drosophila Melanogaster: Structures and Responsiveness to Genetic Modifiers. GeneticsGenetics. 118(2):221-234.
2001. Approximating large convolutions in digital images. Image Processing, IEEE Transactions on. 10(12):1826-1835.
2002. Partitioning planar graphs with costs and weights. 4th International Workshop on Algorithm Engineering and Experiments. 2409:98-110.
1988. Globally-Equiangular triangulations of co-circular points in 0(n log n) time. Proceedings of the fourth annual symposium on Computational geometry. :143-152.