A fast planar partition algorithm, II
DOI10.1145/102782.102785zbMATH Open0799.68190OpenAlexW2011699817MaRDI QIDQ4302829FDOQ4302829
Authors: 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
Recommendations
- A fast planar partition algorithm. I
- Constructing Planar Cuttings in Theory and Practice
- Computing a Face in an Arrangement of Line Segments and Related Problems
- Partitioning arrangements of lines. I: An efficient deterministic algorithm
- A new point-location algorithm and its practical efficiency: comparison with existing algorithms
computational complexitycomputational geometryplanar subdivisionhidden surface removalrandomized geometric algorithmsvirtual clipping
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)
Cited In (11)
- Title not available (Why is that?)
- An exact and efficient approach for computing a cell in an arrangement of quadrics
- A fast planar partition algorithm. I
- Title not available (Why is that?)
- A unified scheme for detecting fundamental curves in binary edge images
- Optimal window queries on line segments using the trapezoidal search DAG
- An optimal algorithm for the boundary of a cell in a union of rays - Corrigendum
- Randomized incremental construction of Delaunay and Voronoi diagrams
- A Speculative Approach to Clipping Line Segments
- On-line construction of the upper envelope of triangles and surface patches in three dimensions
- Markov incremental constructions
This page was built for publication: A fast planar partition algorithm, II
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4302829)
