Publications
2010. A dynamic data structure for approximate range searching. Proceedings of the 2010 annual symposium on Computational geometry. :247-256.
2000. Quantile approximation for robust statistical estimation and k-enclosing problems. International Journal of Computational Geometry and Applications. 10(6):593-608.
2002. Evidence for a Plastid Origin of Plant Ethylene Receptor Genes. Plant PhysiologyPlant Physiol.. 130(1):10-14.
1991. Combinatorial and computational aspects of Minkowski decompositions. Contemporary Mathematics. 119:107-124.
1983. The U1 small nuclear RNA-protein complex selectively binds a 5′ splice site in vitro. Cell. 33(2):509-518.
1991. The densest double-lattice packing of a convex polygon. Discrete and Computational Geometry: Papers from the DIMACS Special Year. 6:245-262.
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.
2000. Pre-Messenger RNA Processing Factors in the Drosophila Genome. The Journal of Cell BiologyJ Cell Biol. 150(2):F37-F44-F37-F44.
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.