Publications

Search
Export 20 results:
Author Title Type [ Year(Asc)]
Filters: Keyword is computational geometry  [Clear All Filters]
2011
Turaga P, Veeraraghavan A, Srivastava A, Chellappa R.  2011.  Statistical Computations on Grassmann and Stiefel Manifolds for Image and Video-Based Recognition. IEEE Transactions on Pattern Analysis and Machine Intelligence. 33(11):2273-2286.
2010
Turaga P, Biswas S, Chellappa R.  2010.  The role of geometry in age estimation. 2010 IEEE International Conference on Acoustics Speech and Signal Processing (ICASSP). :946-949.
2008
Arya S, Fonseca G, Mount D.  2008.  Tradeoffs in Approximate Range Searching Made Simpler. Computer Graphics and Image Processing, 2008. SIBGRAPI '08. XXI Brazilian Symposium on. :237-244.
2006
De Floriani L, Hui A.  2006.  A Dimension-Independent Representation for Multiresolution Nonmanifold Meshes. Journal of Computing and Information Science in Engineering. 6(4):397-404.
2005
Ji H, Fermüller C.  2005.  Integration of motion fields through shape. IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2005. CVPR 2005. 2:663-669vol.2-663-669vol.2.
Shi Q, JaJa JF.  2005.  Optimal and near-optimal algorithms for generalized intersection reporting on pointer machines. Information Processing Letters. 95(3):382-388.
2003
Cardone A, Gupta SK, Karnik M.  2003.  A Survey of Shape Similarity Assessment Algorithms for Product Design and Manufacturing Applications. Journal of Computing and Information Science in EngineeringJ. Comput. Inf. Sci. Eng.. 3(2):109-118.
2002
Agarwal PK, Guibas LJ, Edelsbrunner H, Erickson J, Isard M, Har-Peled S, Hershberger J, Jensen C, Kavraki L, Koehl P et al..  2002.  Algorithmic issues in modeling motion. ACM Comput. Surv.. 34(4):550-572.
Kanungo T, Mount D, Netanyahu NS, Piatko CD, Silverman R, Wu AY.  2002.  A local search approximation algorithm for k-means clustering. Proceedings of the eighteenth annual symposium on Computational geometry. :10-18.
2001
Srinivasan A.  2001.  Distributions on level-sets with applications to approximation algorithms. 42nd IEEE Symposium on Foundations of Computer Science, 2001. Proceedings. :588-597.
Mount D, Netanyahu NS.  2001.  Efficient randomized algorithms for robust estimation of circular arcs and aligned ellipses. Computational Geometry. 19(1):1-33.
2000
Yao Z, Gupta SK, Nau DS.  2000.  A Geometric Algorithm for Finding the Largest Milling Cutter. ISR; TR 2000-40
Arya S, Malamatos T, Mount D.  2000.  Nearly optimal expected-case planar point location. Foundations of Computer Science, 2000. Proceedings. 41st Annual Symposium on. :208-218.
1998
Radhakrishnan J, Srinivasan A.  1998.  Improved bounds and algorithms for hypergraph two-coloring. 39th Annual Symposium on Foundations of Computer Science, 1998. Proceedings. :684-693.
1994
Arya S, Mount D, Smid M.  1994.  Randomized and deterministic algorithms for geometric spanners of small diameter. Foundations of Computer Science, 1994 Proceedings., 35th Annual Symposium on. :703-712.
1993
Fermüller C.  1993.  Motion constraint patterns. , Proceedings of IEEE Workshop on Qualitative Vision, 1993. :128-139.
1992
Fermüller C, Kropatsch W.  1992.  Multi-resolution shape description by corners. , 1992 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 1992. Proceedings CVPR '92. :271-276.
1990
Khuller S, Mitchell JSB.  1990.  On a triangle counting problem. Information Processing Letters. 33(6):319-321.