Constructing Planar Cuttings in Theory and Practice
From MaRDI portal
Publication:4507335
DOI10.1137/S0097539799350232zbMath0981.65027MaRDI QIDQ4507335
Publication date: 18 October 2000
Published in: SIAM Journal on Computing (Search for Journal in Brave)
68R05: Combinatorics in computer science
65D18: Numerical aspects of computer graphics, image analysis, and computational geometry
51N05: Descriptive geometry
Related Items
Approximating the k-Level in Three-Dimensional Plane Arrangements, AN EXPERIMENTAL STUDY OF ON-LINE METHODS FOR ZONE CONSTRUCTION IN ARRANGEMENTS OF LINES IN THE PLANE, Unnamed Item, Optimal randomized incremental construction for guaranteed logarithmic planar point location, The overlay of minimization diagrams in a randomized incremental construction, Computing the least quartile difference estimator in the plane, Almost tight bounds for eliminating depth cycles in three dimensions, Decomposing arrangements of hyperplanes: VC-dimension, combinatorial dimension, and point location, Cutting algebraic curves into pseudo-segments and applications