### Abstract

One of the most recurring themes in many computer applications such as graphics automated cartography, image processing and robotics is the notion of visibility. We are concerned with the visibility between two edges of a simple n-vertex polygon. Four natural definitions of edge-to-edge visibility are proposed. There exist O(nlog n) algorithms and complicated O(nlog log n) algorithms to solve this problem partially and indirectly. A linear running time, and thus optimal algorithm is presented to determine edge-to-edge visibility under any of the four definitions. This simple, efficient, and direct algorithm without computing the triangulation of the simple polygon also identifies the visibility region if it exists.

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

Pages (from-to) | 342-357 |

Number of pages | 16 |

Journal | The Visual Computer |

Volume | 2 |

Issue number | 6 |

DOIs | |

State | Published - Dec 1 1986 |

### Fingerprint

### Keywords

- Algorithms
- Computational geometry
- Convex hull
- Geometric complexity
- Graphics
- Hidden line problems
- Jordan sorting
- Monotone polygons
- Polygon
- Visibility
- Weak visibility

### ASJC Scopus subject areas

- Software
- Computer Vision and Pattern Recognition
- Computer Graphics and Computer-Aided Design

### Cite this

*The Visual Computer*,

*2*(6), 342-357. https://doi.org/10.1007/BF01952419