Point visibility graphs and script O sign-convex cover

International Journal of Computational Geometry and Applications

Volumn 10, Issue 1, 2000, Pages 55-71

  Bremner, David ^a   Shermer, Thomas ^b  

^a UNIVERSITY OF WASHINGTON   (United States)

^b SIMON FRASER UNIVERSITY   (Canada)

Author keywords

Approximation; Convex cover; Generalized visibility; Restricted orientation

Indexed keywords

EID: 0347699527     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/s0218195900000048     Document Type: Article

References (24)

1. A. Aggarwal. "The art gallery theorem: Its variations, applications and algorithmic aspects." Ph.D. thesis, Dept. of Elec. Eng. and Computer Science, Johns Hopkins University, 1984.
2. M. Breen. "Unions of orthogonally convex or orthogonally starshaped polygons." Geom. Dedicata 53 (1994) 49-56. ISSN 0046-5755.
3. D. Bremner and T. Shermer. "Point visibility graphs and restricted-orientation convex cover." Technical Report CMPT TR 93-07, School of Computing Science, Simon Fraser University, 1993.
4. J. Culberson and R. A. Reckhow. "Orthogonally convex coverings of orthogonal polygons without holes." J. Comput. Syst. Sci. 39 (1989) 166-204.
5. _. "Covering polygons is hard." Journal of Algorithms 17 (1994) 2-44.
6. D. Gans. Transformations and Geometries (Appleton-Century-Crofts, 1969).
7. M. C. Golumbic. Algorithmic Graph Theory and Perfect Graphs (Academic Press, 1980).
8. M. Grötschel, L. Lovász and A. Schrijver. "The ellipsoid method and its consequences on combinatorial optimization." Combinatorica 1 (1981) 169-197.
9. R. Hayward. "Weakly triangulated graphs." J. Comb. Theory B 39 (1985) 200-209.
10. A. Held and K. Abe. "On the decomposition of binary shapes into meaningful parts." Pattern Recognition 27 (1996) 637-647.
11. J. M. Keil. "Minimally covering a horizontally convex orthogonal polygon." In Proc. 2nd Symp. on Comp. Geom. (1986) pp. 43-51, pp. 43-51.
12. D. T. Lee and F. P. Preparata. "Euclidean shortest paths in the presence of rectilinear barriers." Networks 14 (1984) 393-410.
13. E. Lodi, F. Luccio and X. Song. "A 2D channel router for the diagonal routing model." Integration, the VLSI journal 11 (1991) 111-125.
14. R. Motwani, A. Ragunathan and H. Saran. "Perfect graphs and orthogonally convex covers." SIAM J. Disc. Math. 2 (1989) 371-392.
15. J. O'Rourke. Computational Geometry in C (Cambridge University Press, 1994).
16. A. Raghunathan. "Polygon decomposition and perfect graphs." Ph.D. thesis, University of California at Berkeley, 1988.
17. G. J. Rawlins. "Explorations in restricted oriented geometry." Ph.D. thesis, University of Waterloo, 1987.
18. G. J. Rawlins and D. Wood. "Restricted-oriented convex sets." Inf. Sci. 54 (1991) 263-281.
19. M. Sarrafzadeh and C. Wong. "Hierarchical steiner tree construction in uniform orientations." IEEE Trans. Comput.-Aided Design Integrated Circuits 11 (1992) 1095-1103.
20. _. An introduction to VLSI physical design (McGraw-Hill, 1996).
21. L. G. Shapiro. "Recent progress in shape decomposition and analysis." In Progress in pattern recognition 2, L. N. Kanal and A. Rosenfeld, eds., number 2 in Progress in Machine Intelligence and Pattern Recognition (Elsevier Science, Amsterdam, 1985) pp. 113-124, pp. 113-124.
22. T. C. Shermer. "Convex cover is NP-hard.", 1988. Note.
23. _. "Visibility properties of polygons." Ph.D. thesis, McGill University, Montréal, 1989.
24. J. Xu. "Morphological decomposition of 2D binary shapes into meaningful parts." Pattern Recognition Letters 17 (1996) 759-769.