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.
https://hal.inria.fr/inria-00413170
Contributeur : Olivier Devillers
<>
Soumis le : jeudi 3 septembre 2009 - 13:42:11
Dernière modification le : mercredi 7 mars 2018 - 10:42:19
Document(s) archivé(s) le : mardi 15 juin 2010 - 23:08:06
Mark De Berg, Olivier Devillers, Katrin Dobrindt, Otfried Schwarzkopf. Computing a single cell in the union of two simple polygons. Information Processing Letters, Elsevier, 1997, 63, pp.215-219. 〈10.1016/S0020-0190(97)00125-7〉. 〈inria-00413170〉
