Merging Free Trees in Parallel for Efficient Voronoi Diagram Construction (Preliminary Version).
01/1990; pp.432-445 In proceeding of: Automata, Languages and Programming, 17th International Colloquium, ICALP90, Warwick University, England, July 16-20, 1990, Proceedings
[show abstract] [hide abstract]
ABSTRACT: We describe ann-processor,O(log(n) log log(n))-time CRCW algorithm to construct the Voronoi diagram for a set ofn point-sites in the plane.Algorithmica 11/1996; 16(6):569-617. · 0.60 Impact Factor
Data provided are for informational purposes only. Although carefully collected, accuracy cannot be guaranteed. The impact factor represents a rough estimation of the journal's impact factor and does not reflect the actual current impact factor. Publisher conditions are provided by RoMEO. Differing provisions from the publisher's actual policy or licence agreement may be applicable.