A fast planar partition algorithm. I

DOI10.1016/S0747-7171(08)80064-8zbMath0717.68104MaRDI QIDQ2638830

Ketan D. Mulmuley

Publication date: 1990

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

zbMATH Keywords

computer graphicsrandomized algorithmplanar partition problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)

Related Items (16)

Advanced programming techniques applied to CGAL's arrangement package ⋮ Adaptive Point Location in Planar Convex Subdivisions ⋮ Optimal randomized incremental construction for guaranteed logarithmic planar point location ⋮ Towards an Optimal Method for Dynamic Planar Point Location ⋮ On-line construction of the upper envelope of triangles and surface patches in three dimensions ⋮ Average case analysis of dynamic geometric optimization ⋮ Untangling planar curves ⋮ Optimal window queries on line segments using the trapezoidal search DAG ⋮ Farthest-polygon Voronoi diagrams ⋮ Markov incremental constructions ⋮ GUARDING ART GALLERIES BY GUARDING WITNESSES ⋮ A binomial sum of harmonic numbers ⋮ On the union of fat wedges and separating a collection of segments by a line ⋮ Reporting intersecting pairs of convex polytopes in two and three dimensions ⋮ Rounding Arrangements Dynamically ⋮ FINDING THE LARGEST EMPTY DISK CONTAINING A QUERY POINT

Cites Work

• Unnamed Item
• Reporting and counting segment intersections
• Algorithms for Reporting and Counting Geometric Intersections
• Constructing Arrangements of Lines and Hyperplanes with Applications

This page was built for publication: A fast planar partition algorithm. I