An optimal algorithm for extracting the regions of a plane graph


In at recent paper. Fan and Chang (19911 presented an algorithm for extracting all regions of a plane graph. It is shown in this paper that their algorithm has quadratic time and space complexity. We propose an optimal algorithm which takes O(m log m) computation time and uses O(nt) space, where m is the number of edges of the plane graph. The optimality ol… (More)
DOI: 10.1016/0167-8655(93)90104-L


3 Figures and Tables

Slides referencing similar topics