Skip Nav Destination
Close Modal
Update search
Filter
- Title
- Author
- Author Affiliations
- Full Text
- Abstract
- Keyword
- DOI
- ISBN
- ISBN-10
- ISSN
- EISSN
- Issue
- Journal Volume Number
- References
- Conference Volume Title
- Paper No
Filter
- Title
- Author
- Author Affiliations
- Full Text
- Abstract
- Keyword
- DOI
- ISBN
- ISBN-10
- ISSN
- EISSN
- Issue
- Journal Volume Number
- References
- Conference Volume Title
- Paper No
Filter
- Title
- Author
- Author Affiliations
- Full Text
- Abstract
- Keyword
- DOI
- ISBN
- ISBN-10
- ISSN
- EISSN
- Issue
- Journal Volume Number
- References
- Conference Volume Title
- Paper No
Filter
- Title
- Author
- Author Affiliations
- Full Text
- Abstract
- Keyword
- DOI
- ISBN
- ISBN-10
- ISSN
- EISSN
- Issue
- Journal Volume Number
- References
- Conference Volume Title
- Paper No
Filter
- Title
- Author
- Author Affiliations
- Full Text
- Abstract
- Keyword
- DOI
- ISBN
- ISBN-10
- ISSN
- EISSN
- Issue
- Journal Volume Number
- References
- Conference Volume Title
- Paper No
Filter
- Title
- Author
- Author Affiliations
- Full Text
- Abstract
- Keyword
- DOI
- ISBN
- ISBN-10
- ISSN
- EISSN
- Issue
- Journal Volume Number
- References
- Conference Volume Title
- Paper No
NARROW
Format
Article Type
Subject Area
Topics
Date
Availability
1-1 of 1
Keywords: visibility graph
Close
Follow your search
Access your saved searches in your account
Would you like to receive an alert when new items match your search?
Sort by
Journal Articles
Publisher: ASME
Article Type: Research Papers
J. Comput. Inf. Sci. Eng. September 2011, 11(3): 031002.
Published Online: August 1, 2011
... of the visibility graph of P (or D ), and R is the number of reflex vertices in D . Our approach is based on the novel idea utilizing the dual graph of the trapezoidal map of P (or D ). For polygonal domains, our approach uses a trapezoidal map associated with each visibility edge of D , and we show how to compute...
