Computing the rectilinear link diameter of a polygon (original) (raw)

Computing the rectilinear link diameter of a polygon

Lecture Notes in Computer Science, 1991

Bengt J. Nilsson

Sven Schuierer

Abstract

The problem of finding the diameter of a simple polygon has been studied extensively in recent years. O(n log n) time upper bounds have been given for computing the geodesic diameter and the link diameter for a polygon.

Bengt J. Nilsson hasn't uploaded this paper.

Let Bengt J. know you want this paper to be uploaded.

Ask for this paper to be uploaded.