A fast planar partition algorithm, II

DOI10.1145/102782.102785MaRDI QIDQ4302829zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

computational complexitycomputational geometryhidden surface removalplanar subdivisionrandomized 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)

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

Cited in

(12)

• Randomized incremental construction of Delaunay and Voronoi diagrams
• On-line construction of the upper envelope of triangles and surface patches in three dimensions
• An exact and efficient approach for computing a cell in an arrangement of quadrics
• A fast planar partition algorithm. I
• An optimal algorithm for the boundary of a cell in a union of rays - Corrigendum
• scientific article; zbMATH DE number 1262793 (Why is no real title available?)
• scientific article; zbMATH DE number 2109157 (Why is no real title available?)
• A Speculative Approach to Clipping Line Segments
• Markov incremental constructions
• A unified scheme for detecting fundamental curves in binary edge images
• Optimal window queries on line segments using the trapezoidal search DAG
• An O(n n) algorithm for single-source shortest paths in disk graphs

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)