Output-sensitive algorithms for computing nearest-neighbour decision boundaries

Discrete and Computational Geometry

Volumn 33, Issue 4, 2005, Pages 593-604

  Bremner, David ^a   Demaine, Erik ^b   Erickson, Jeff ^c   Iacono, John ^d   Langerman, Stefan ^e   Morin, Pat ^f   Toussaint, Godfried ^g  

^a UNIVERSITY OF NEW BRUNSWICK   (Canada)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c University of Illinois at Urbana Champaign   (United States)

^d POLYTECHNIC UNIVERSITY   (United States)

^e UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

^f CARLETON UNIVERSITY   (Canada)

^g MCGILL UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 17444374947     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00454-004-1152-0     Document Type: Article

References (19)

1. M. Ben-Or. Lower bounds for algebraic computation trees (preliminary report). In Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing, pages 80-86, 1983.
2. B. K. Bhattacharya and S. Sen. On a simple, practical, optimal, output-sensitive randomized planar convex hull algorithm. Journal of Algorithms, 25(1): 177-193, 1997.
3. M. Blum, R. W. Floyd, V. Pratt, R. L. Rivest, and R. E. Tarjan. Time bounds for selection. Journal of Computing and Systems Science, 7:448-461, 1973.
4. T. M. Chan. Optimal output-sensitive convex hull algorithms in two and three dimensions. Discrete & Computational Geometry, 16:361-368, 1996.
5. T. M. Chan, J. Snoeyink, and C. K. Yap. Primal dividing and dual pruning: output-sensitive construction of four-dimensional polytopes and three-dimensional Voronoi diagrams. Discrete & Computational Geometry, 18:433-454, 1997.
6. T. M. Cover and P. E. Hart. Nearest neighbour pattern classification. IEEE Transactions on Information Theory, 13:21-27, 1967.
7. B. Dasarathy and L. J. White. A characterization of nearest-neighbour rule decision surfaces and a new approach to generate them. Pattern Recognition, 10:41-46, 1978.
8. L. Devroye. On the inequality of Cover and Hart. IEEE Transactions on Pattern Analysis and Machine Intelligence, 3:75-78, 1981.
9. D. P. Dobkin and D. G. Kirkpatrick. Fast detection of poyhedral intersection. Theoretical Computer Science, 27:241-253, 1983.
10. D.P. Dobkin and D. G. Kirkpatrick. A linear algorithm for determining the separation of convex polyhedra. Journal of Algorithms, 6:381-392, 1985.
11. C.A.R.Hoare, ACM Algorithm 64: Quicksort. Communications of the ACM, 4(7):321, 1961.
12. D. G. Kirkpatrick. Optimal search in planar subdivisions. SIAM Journal on Computing, 12(1):28-35, 1983.
13. D. G. Kirkpatrick and R. Seidel. The ultimate planar convex hull algorithm? SIAM Journal on Computing, 15(1):287-299, 1986.
14. F. P Preparata and M. I. Shamos. Computational Geometry. Springer-Verlag, New York, 1985.
15. M. I. Shamos. Geometric complexity. In Proceedings of the 7th ACM Symposium on the Theory of Computing (STOC 1975), pages 224-253, 1975.
16. C. Stone. Consistent nonparametric regression. Annals of Statistics, 8:1348-1360, 1977.
17. G.T.Toussaint. Proximity graphs for instance-based learning. Manuscript, 2003.
18. G. T. Toussaint, B. K. Bhattacharya, and R. S. Poulsen. The application of Voronoi diagrams to nonparametric decision rules. In Proceedings of Computer Science and Statistics: 16th Symposium of the Interface, pages 97-108, 1984.
19. R. Wenger. Randomized quick hull. Algorithmica, 17:322-329, 1997.