### Abstract

Given a simple polygon P of n vertices, we present an algorithm that finds the pair of points on the boundary of P that maximizes the external shortest path between them. This path is defined as the external geodesic diameter of P. The algorithm takes 0(n^{2}) time and requires 0(n) space. Surprisingly, this problem is quite different from that of computing the internal geodesic diameter of P. While the internal diameter is determined by a pair of vertices of P, this is not the case for the external diameter. Finally, we show how this algorithm can be extended to solve the all external geodesic furthest neighbours problem.

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

Pages (from-to) | 1-19 |

Number of pages | 19 |

Journal | Computing |

Volume | 44 |

Issue number | 1 |

DOIs | |

State | Published - Mar 1990 |

### Keywords

- AMS Subject Classifications: 68U05, 68C25
- Polygon
- algorithm
- complexity
- computational geometry
- diameter
- furthest neighbour
- geodesics

### ASJC Scopus subject areas

- Software
- Theoretical Computer Science
- Numerical Analysis
- Computer Science Applications
- Computational Theory and Mathematics
- Computational Mathematics

## Fingerprint Dive into the research topics of 'Computing the external geodesic diameter of a simple polygon'. Together they form a unique fingerprint.

## Cite this

Samuel, D., & Toussaint, G. T. (1990). Computing the external geodesic diameter of a simple polygon.

*Computing*,*44*(1), 1-19. https://doi.org/10.1007/BF02247961