Publications
2016. Modeling Sustainability: Population, Inequality, Consumption, and Bidirectional Coupling of the Earth and Human Systems. National Science Review. :nww081.
1992. Intersection detection and separators for simple polygons. Proceedings of the eighth annual symposium on Computational geometry. :303-311.
1997. ANN: A library for approximate nearest neighbor searching. CGC 2nd Annual Fall Workshop on Computational Geometry.
1992. Splicing signals in Drosophila: intron size, information content, and consensus sequences. Nucleic Acids ResearchNucl. Acids Res.. 20(16):4255-4262.
1998. Improved algorithms for robust point pattern matching and applications to image registration. Proceedings of the fourteenth annual symposium on Computational geometry. :155-164.
1997. Genetic depletion reveals an essential role for an SR protein splicing factor in vertebrate cells. BioEssays. 19(3):189-192.
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.
1991. Combinatorial and computational aspects of Minkowski decompositions. Contemporary Mathematics. 119:107-124.
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.