A fast planar partition algorithm, II

DOI10.1145/102782.102785zbMath0799.68190OpenAlexW2011699817MaRDI QIDQ4302829

Ketan D. Mulmuley

Publication date: 13 November 1994

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/102782.102785

zbMATH Keywords

computational complexitycomputational geometryplanar subdivisionhidden surface removalrandomized geometric algorithmsvirtual clipping

Mathematics Subject Classification ID

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

Related Items

On-line construction of the upper envelope of triangles and surface patches in three dimensions, Optimal window queries on line segments using the trapezoidal search DAG, Randomized incremental construction of Delaunay and Voronoi diagrams, Markov incremental constructions, A unified scheme for detecting fundamental curves in binary edge images, An exact and efficient approach for computing a cell in an arrangement of quadrics