A fast planar partition algorithm. I

  title={A fast planar partition algorithm. I},
  author={Ketan Mulmuley},
  journal={[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science},
  • K. Mulmuley
  • Published 24 October 1988
  • Mathematics, Computer Science
  • [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science
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… 
A Fast Planar Partition Algorithm, I
  • K. Mulmuley
  • Mathematics, Computer Science
    J. Symb. Comput.
  • 1990
Though the algorithm itself is simple, the global evolution of the underlying partition is non-trivial, which makes the analysis of the algorithm theoretically interesting in its own right.
A fast planar partition algorithm, II
Randomized, optimal algorithms to find a partition of the plane induced by a set of algebraic segments of a bounded degree, and a set of linear chains of a bounded degree, are given. This paper also
A Tail Estimate for Mulmuley's Segment Intersection Algorithm
The distribution of the running time of Mulmuley's randomized algorithm for computing the intersections of n given segments in the plane is analyzed and it is shown that for values of k not too close to n (k≥Cn log 15n for a large enough constant C), theRunning time is sharply concentrated around the expected value.
Computing faces in segment and simplex arrangements
This work gives the first work-optimal deterministic parallel algorithm for constructing a set of m = O(nd 1 logc n+k) cells of constant descriptive complexity that covers their arrangement, and describes a sequential algorithm for computing a single face in an arrangement of n line segments that improves on a previous O(n log n) time algorithm.
On Enclosing k Points by a Circle
  • J. Matousek
  • Mathematics, Computer Science
    Inf. Process. Lett.
  • 1995
This paper presents randomized algorithms for finding a smallest circle enclosing at least k points of P in the plane and an integer k ⩽ n, which improves on previous results by logarithmic factors.
An optimal algorithm for finding segments intersections
A new deterministic algorithm for finding intersecting pairs from a given set of N segments in the plane that is asymptotically optimal and has time and space complexity O(AJ log N+ K) and 0( IV ) respectively.
On obstructions in relation to a fixed viewpoint
  • K. Mulmuley
  • Mathematics, Computer Science
    30th Annual Symposium on Foundations of Computer Science
  • 1989
Efficient, randomized algorithms are given for the construction of levels of order 1 to k in an arrangement of hyperplanes in any dimension and hidden surface removal for completely general scenes.
Randomized Incremental Construction of Delaunay and Voronoi Diagrams
A new randomized incremental algorithm for the construction of planar Voronoi diagrams and Delaunay triangulations is given which obviates the need for building a separate point-location structure for nearest-neighbor queries.
Randomized incremental construction of Delaunay and Voronoi diagrams
A new randomized incremental algorithm for the construction of planar Voronoi diagrams and Delaunay triangulations is given that takes expected timeO(nℝgn) and spaceO( n), and is eminently practical to implement.
Dynamic maintenance of geometric structures made easy
  • O. Schwarzkopf
  • Mathematics
    [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science
  • 1991
The problem of dynamically maintaining geometric structures is considered. A technique is proposed that uses randomized incremental algorithms which are augmented to allow deletions of objects. A


An optimal algorithm for intersecting line segments in the plane
The authors present the first optimal algorithm for the following problem: given n line segments in the plane, compute all k pairwise intersections in O(n log n+k) time. Within the same asymptotic
Algorithms for Reporting and Counting Geometric Intersections
Algorithms that count the number of pairwise intersections among a set of N objects in the plane and algorithms that report all such intersections are given.
Constructing Arrangements of Lines and Hyperplanes with Applications
An algorithm is presented that constructs a representation for the cell complex defined by n hyperplanes in optimal $O(n^d )$ time in d dimensions, which is shown to lead to new methods for computing $\lambda $-matrices, constructing all higher-order Voronoi diagrams, halfspatial range estimation, degeneracy testing, and finding minimum measure simplices.
Applications of random sampling in computational geometry, II
Asymptotically tight bounds for a combinatorial quantity of interest in discrete and computational geometry, related to halfspace partitions of point sets, are given.
Intersecting is easier than sorting
This paper settles a long-standing open question of computational geometry: <italic>Is it possible to compute all k intersections between n arbitrary line segments in time linear in k?</italic> We