Computing a single cell in the overlay of two simple polygons

M. Berg, de, O. Devillers, K.T.G. Dobrindt, O. Schwarzkopf

    Research output: Contribution to journalArticleAcademicpeer-review

    4 Citations (Scopus)

    Abstract

    This note combines the lazy randomized incremental construction scheme with the technique of "connectivity acceleration" to obtain an O(n(log* n)2) time randomized algorithm to compute a single face in the overlay of two simple polygons in the plane.
    Original languageEnglish
    Pages (from-to)215-219
    JournalInformation Processing Letters
    Volume63
    Issue number4
    DOIs
    Publication statusPublished - 1997

    Fingerprint Dive into the research topics of 'Computing a single cell in the overlay of two simple polygons'. Together they form a unique fingerprint.

    Cite this