Constructing Planar Cuttings in Theory and Practice

DOI10.1137/S0097539799350232zbMath0981.65027MaRDI QIDQ4507335

Sariel Har-Peled

Publication date: 18 October 2000

Published in: SIAM Journal on Computing (Search for Journal in Brave)

zbMATH Keywords

computational geometrycuttingsrandomized incremental algorithmrange-searching

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Descriptive geometry (51N05)

Related Items (9)

Optimal randomized incremental construction for guaranteed logarithmic planar point location ⋮ Cutting algebraic curves into pseudo-segments and applications ⋮ Decomposing arrangements of hyperplanes: VC-dimension, combinatorial dimension, and point location ⋮ The overlay of minimization diagrams in a randomized incremental construction ⋮ Approximating the k-Level in Three-Dimensional Plane Arrangements ⋮ Unnamed Item ⋮ Almost tight bounds for eliminating depth cycles in three dimensions ⋮ AN EXPERIMENTAL STUDY OF ON-LINE METHODS FOR ZONE CONSTRUCTION IN ARRANGEMENTS OF LINES IN THE PLANE ⋮ Computing the least quartile difference estimator in the plane

This page was built for publication: Constructing Planar Cuttings in Theory and Practice