A fast planar partition algorithm. I

Authors:
K. Mulmuley
Affiliations:
Chicago Univ., IL, USA
Venue:
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Year:
1988

Citing 0
Cited 7

An efficient algorithm for hidden surface removal, II

Proceedings of the 30th IEEE symposium on Foundations of computer science
Toward Spatial Joins for Polygons

SSDBM '00 Proceedings of the 12th International Conference on Scientific and Statistical Database Management
New Scheduling Strategies for Randomized Incremental Algorithms in the Context of Speculative Parallelization

IEEE Transactions on Computers
Constructing the exact Voronoi diagram of arbitrary lines in three-dimensional space with fast point-location

ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Bold graph drawings

Computational Geometry: Theory and Applications
Overlaying multiple maps efficiently

CIT'04 Proceedings of the 7th international conference on Intelligent Information Technology
Every graph admits an unambiguous bold drawing

GD'11 Proceedings of the 19th international conference on Graph Drawing

Quantified Score

Hi-index	0.00

Visualization

Abstract

A fast randomized algorithm is given for finding a partition of the plane induced by a given set of linear segments. The algorithm is ideally suited for a practical use because it is extremely simple and robust, as well as optimal; its expected running time is O(m+n log n) where n is the number of input segments and m is the number of points of intersection. The storage requirement is O(m+n). Though the algorithm itself is simple, the global evolution of the partition is complex, which makes the analysis of the algorithm theoretically interesting in its own right.