Circular Separability of Polygons

Two planar sets are circularly separable if there exists a circle enclosing one of the sets and whose open interior disk does not intersect the other set. This paper studies two problems related to circular separability. A linear-time algorithm is proposed to decide if two polygons are circularly se...

Full description

Bibliographic Details
Published in:Algorithmica : an international journal in computer science, Vol. 30, No. 1 (2001), p. 67-82
Main Author: -D. Boissonnat, J.
Other Involved Persons: Czyzowicz, J. ; Devillers, O. ; Yvinec, M.
Format: electronic Article
Item Description:Received October 25, 1998; revised April 21, 1999.
Physical Description:Online-Ressource
QR Code: Show QR Code