First Page | Document Content | |
---|---|---|
![]() Date: 2005-02-14 10:46:20Convex geometry Computational geometry Euclidean plane geometry Convex hull Simple polygon Point in polygon Gift wrapping algorithm Vertex Convex and concave polygons Geometry Convex hull algorithms Polygons | Add to Reading List |
![]() | Data Structures for Restricted Triangular Range Searching 13th August, 2008 Nadia Benbernou, Mashhood Ishaque, and Diane SouvaineDocID: 1o9V9 - View Document |
![]() | 6.006 Intro to Algorithms Recitation 24 May 6, 2011DocID: 1mr6f - View Document |
![]() | CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 Data Structures for Restricted Triangular Range Searching Nadia M. Benbernou∗ Mashhood Ishaque†DocID: 1lUGL - View Document |
![]() | Randomized Triangle Algorithms for Convex Hull Membership Bahman Kalantari∗ Abstract angle algorithm performs quite well when comparedDocID: 1lQ03 - View Document |
![]() | Relative Convex Hulls in Semi-Dynamic Subdivisions Mashhood Ishaque1? and Csaba D. T´oth2?? 1 Dept. of Comp. Sci., Tufts University, Medford, MA,DocID: 1kG2O - View Document |