### Abstract

In many computer applications areas such as graphics, automated cartography, image processing, and robotics the notion of visibility among objects modeled as polygons is a recurring theme. This paper is concerned with the visibility of a simple polygon from one of its edges. Three natural definitions of the visibility of a polygon from an edge presented. The following computational problem is considered. Given an n -sided simple polygon, is the polygon visible from a specified edge? An O(n), and thus optimal, algorithm is exhibited for determining edge visibility under any of the three definitions. The paper closes with an interesting characterization of visibility and some open problems in this area.

Original language | English (US) |
---|---|

Pages (from-to) | 910-914 |

Number of pages | 5 |

Journal | IEEE Transactions on Computers |

Volume | C-30 |

Issue number | 12 |

DOIs | |

State | Published - Jan 1 1981 |

### Fingerprint

### ASJC Scopus subject areas

- Theoretical Computer Science
- Software
- Hardware and Architecture
- Computational Theory and Mathematics

### Cite this

**An Optimal Algorithm for Determining the Visibility of a Polygon from an Edge.** / Avis, David; Toussaint, Godfried.

Research output: Contribution to journal › Article

*IEEE Transactions on Computers*, vol. C-30, no. 12, pp. 910-914. https://doi.org/10.1109/TC.1981.1675729

}

TY - JOUR

T1 - An Optimal Algorithm for Determining the Visibility of a Polygon from an Edge

AU - Avis, David

AU - Toussaint, Godfried

PY - 1981/1/1

Y1 - 1981/1/1

N2 - In many computer applications areas such as graphics, automated cartography, image processing, and robotics the notion of visibility among objects modeled as polygons is a recurring theme. This paper is concerned with the visibility of a simple polygon from one of its edges. Three natural definitions of the visibility of a polygon from an edge presented. The following computational problem is considered. Given an n -sided simple polygon, is the polygon visible from a specified edge? An O(n), and thus optimal, algorithm is exhibited for determining edge visibility under any of the three definitions. The paper closes with an interesting characterization of visibility and some open problems in this area.

AB - In many computer applications areas such as graphics, automated cartography, image processing, and robotics the notion of visibility among objects modeled as polygons is a recurring theme. This paper is concerned with the visibility of a simple polygon from one of its edges. Three natural definitions of the visibility of a polygon from an edge presented. The following computational problem is considered. Given an n -sided simple polygon, is the polygon visible from a specified edge? An O(n), and thus optimal, algorithm is exhibited for determining edge visibility under any of the three definitions. The paper closes with an interesting characterization of visibility and some open problems in this area.

UR - http://www.scopus.com/inward/record.url?scp=0019683897&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0019683897&partnerID=8YFLogxK

U2 - 10.1109/TC.1981.1675729

DO - 10.1109/TC.1981.1675729

M3 - Article

AN - SCOPUS:0019683897

VL - C-30

SP - 910

EP - 914

JO - IEEE Transactions on Computers

JF - IEEE Transactions on Computers

SN - 0018-9340

IS - 12

ER -