Overlaying Simply Connected Planar Subdivisions in Linear Time

@inproceedings{Finke1995OverlayingSC,
title={Overlaying Simply Connected Planar Subdivisions in Linear Time},
author={Ulrich Finke and Klaus H. Hinrichs},
booktitle={Symposium on Computational Geometry},
year={1995}
}

We present an algorithm which computes the overlay Hb r+ rIg of two Simply connected planar subdivisions ~b and Hg; we assume that ~b (resp. ~) and all its components are colored in blue (resp. green). The algorithm runs in O(n + k) time and space, where n denotes the total nuruber of edges of ~b and IIg and k the number of intersections between blue and green edges.