Sequential and parallel algorithms for finding a maximum convex polygon

Computational Geometry: Theory and Applications

Volumn 7, Issue 3, 1997, Pages 187-200

  Fischer, Paul ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

Computational geometry; Convex polygons

Indexed keywords

EID: 0038903757     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/0925-7721(95)00035-6     Document Type: Article

References (12)

1. A. Aggarwal and S. Suri, Fast algorithms for computing the largest empty rectangle, in: Proc. 3rd Symp. Comput. Geom. (1987) 278-290.
2. B. Chazelle, R. Drysdale and D. Lee, Computing the largest empty rectangle, SIAM J. Comput. 15 (1986) 300-315.
3. B. Chazelle, A functional approach to data structures and its use in multidimensional searching, SIAM J. Comput. 17 (1988) 427-462.
4. V. Chvátal and G. Klincsek, Finding largest convex subsets, Congressus Numerantium 29 (1980) 453-460.
5. D. Eppstein, M. Overmars, G. Rote and G. Woeginger, Finding minimum area k-gons, Discrete Comput. Geom. 7 (1992) 45-58.
6. H. Edelsbrunner and F.P. Preparata, Minimal polygonal separation, Inform. and Comput. 77 (1988) 218-232.
7. P. Fischer, Finding maximum convex polygons, in: Z. Esik, ed., Proc. Fund. Comput. Theory (FCT'93), Lecture Notes in Computer Science 710 (Springer, Berlin, 1993) 234-243.
8. P. Fischer, Learning unions of convex polygons, in: J. Shawe-Taylor and M. Anthony, eds., Computational Learning Theory: Euro-Colt'93 (1994) 61-67.
9. P. Fischer, More or less efficient agnostic learning of convex polygons, in: Proc. 8th Conf. Comput. Learning Theory (ACM, New York, 1995) 337-344.
10. P. Fischer and S. Kwek, Minimizing disagreements for geometric concepts using dynamic programming, in preparation, 1995.
11. J. JáJá, An Introduction to Parallel Algorithms (Addison Wesley, Reading, MA, 1992).
12. F. Preparata and M. Shamos, Computational Geometry, An Introduction (Springer, New York, 1985).