Decision trees for geometric models

International Journal of Computational Geometry and Applications

Volumn 8, Issue 3, 1998, Pages 343-363

  Arkin, Esther M ^a   Meijer, Henk ^b   Mitchell, Joseph S B ^a   Rappaport, David ^b   Skiena, Steven S ^a  

^a Stony Brook University   (United States)

^b QUEEN S UNIVERSITY   (Canada)

Author keywords

Algorithms; Approximation algorithms; Complexity; Computational geometry; Computer vision; Decision trees; Probing; Set cover

Indexed keywords

EID: 0032329312     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218195998000175     Document Type: Article

References (34)

1. E. M. Arkin and J. S. B. Mitchell, "Applications of combinatorics and computational geometry to pattern recognition," Technical Report, Cornell University, 1990.
2. E. M. Arkin, M. T. Goodrich, J. S. B. Mitchell, D. Mount, C. D. Piatko, and S. S. Skiena, "Point probe decision trees for geometric concept classes," In Proc. 3rd Workshop Algorithms Data Struct., volume 709 of Lecture Notes in Computer Science, pages 95-106. Springer-Verlag, 1993.
3. E. M. Arkin, H. Meijer, J.S.B. Mitchell, D. Rappaport, and S.S. Skiena, "Decision trees for geometric models," In Proc. 9th Annu. ACM Sympos. Comput. Geom., May, 1993, pp. 368-378.
4. P. Belleville and T. G. Shermer, "Probing polygons minimially is hard," Comput. Geom. Theory Appl. 2 (1993), 255-265.
5. H. Bernstein, "Determining the shape of a convex n-sided polygon by using 2n + k tactile probes," Inform. Process. Lett., 22 (1986), 255-260.
6. E. Bienenstock, D. Geman, and S. Geman, "A relational approach in object recognition," Technical Report, Brown University, 1988.
7. E. Bienenstock, D. Geman, S. Geman, and D.E. McClure, "Phase II technical report, development of laser radar ATR algorithms," Technical Report Contract No. DAAL02-89-C-0081, CECOM Center for Night Vision and Electro-Optics, October 1990.
8. L. Breiman, J.H. Friedman, R. A. Olshen, and C.J. Stone, Classification and Regression Trees, Wadsworth Inc., Belmont, California, 1984.
9. H. Brönnimann and M. T. Goodrich, "Almost optimal set covers in finite VC-dimension," Discrete Comput. Geom., 14 (1995), 263-279.
10. B. Chazelle and H. Edelsbrunner, "An optimal algorithm for intersecting line segments in the plane," J. ACM, 39 (1992), 1-54.
11. R. Chin and C. Dyer, "Model-based recognition in robot vision," ACM Comput. Surv., 18 (1986), 67-108.
12. P. A. Chou, "Optimal partitioning for classification and regression trees," IEEE Trans. Pattern Anal. Mach. Intell. 13 (1991), 340-354.
13. H. De Fraysseix, J. Pach, and R. Pollack, "How to draw a planar graph on a grid," Combinatorica, 10 (1990), 41-51.
14. H. Edelsbrunner, Algorithms in Combinatorial Geometry, Springer-Verlag, Heidelberg, 1987.
15. A. Fiat and A. Shamir, "How to find a battleship," Networks, 19 (1989), 361-371.
16. R. J. Fowler, M. S. Paterson, and L. Tanimoto, "Optimal packing and covering in the plane are NP-complete," Inform. Process. Lett., 12 (1981), 133-137.
17. K. Y. Fung, T. M. Nicholl, R. E. Tarjan, and C. J. Van Wyk, "Simplified linear-time Jordan sorting and polygon clipping," Inform. Process. Lett., 35 (1990), 85-92.
18. M. Garey, "Optimal binary identification procedures," SIAM J. Appl. Math., 23 (1972), 173-186.
19. P. Gaston and T. Lozano-Perez, "Tactile recognition and localization using object models: The case of polyhedra on a plane," IEEE Trans. Pattern Anal. Mach. Intell., 6 (1984), 257-266.
20. M. C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, NY, 1980.
21. R. Goodman and P. Smyth, "Decision tree design from a communication theory standpoint," IEEE Trans. Inform. Theory, 34 (1988), 979-994.
22. W. E. Crimson, "The combinatorics of local constraints in model-based recognition and localization from sparse data," J. ACM, 33 (1986), 658-686.
23. W. E. Crimson and T. Lozano-Perez, "Localizing overlapping parts by searching the interpretation tree," IEEE Trans. Pattern Anal. Mach. Intell., 9 (1987), 469-482.
24. K. Hoffmann, K. Mehlhorn, P. Rosenstiehl, and R. E. Tarjan, "Sorting Jordan sequences in linear time using level-linked search trees," Inform. Control, 68 (1986), 170-184.
25. L. Hyafil and R. Rivest, "Constructing optimal binary decision trees is NP-complete," Inform. Process. Lett., 5 (1976), 15-17.
26. D. S. Johnson, "Approximation algorithms for combinatorial problems," J. Comp. Sys. Sciences, 9 (1974), 256-278.
27. E. Joseph and S. Skiena, "Model-based probing strategies for convex polygons," Comput. Geom. Theory Appl, 2 (1992), 209-221.
28. D. Lichtenstein, "Planar formulae and their uses," SIAM J. Comput., 11 (1982), 329-343.
29. K. Lyons and D. Rappaport, "An efficient algorithm for identifying objects using robot probes," Visual Comput., 10 (1994), 452-458.
30. V. Mirelli, "Computer vision is a highly structured optimization problem," Manuscript, Center for Night Vision and Electro-Optics, Fort Belvoir, VA, 1990.
31. B. Moret, "Decision trees and diagrams," ACM Comput. Surv., 14 (1982), 593-623.
32. C. H. Papadimitriou, "On certain problems in algorithmic vision," Technical Re-port, Computer Science, Univ. California San Diego, 1991.
33. S. R. Safavian and D. Landgrebe, "A survey of decision tree classifier methodology," IEEE Trans. Syst. Man Cybern., 21 (1991), 660-674.
34. S. S. Skiena, "Interactive reconstruction via probing," IEEE Proceedings, 80 (1992), 1364-1383.