Cutting hyperplanes for divide-and-conquer (Q1209837)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 168598
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Cutting hyperplanes for divide-and-conquer |
scientific article; zbMATH DE number 168598 |
Statements
Cutting hyperplanes for divide-and-conquer (English)
0 references
16 May 1993
0 references
A \((1/r)\)-cutting for a set of \(n\) hyperplanes in \(E^ d\) is the cover of the space by \(d\)-simplices with disjoint interiors such that the interior of each simplex intersects at most \(n/r\) hyperplanes. This structure leads to efficient solutions for many geometric problems, and a number of probabilistic and deterministic algorithms have been proposed for construction of cuttings. The paper presents a deterministic algorithm for computing a \((1/r)\)- cutting of \(O(r^ d)\) size in \(O(nr^{d-1})\) time. This leads to improvements in algorithms for a number of geometric problems, e.g., counting segment intersections, line/point incidence counting, point location. In addition, a simplified version of Clarkson's algorithm for linear programming in fixed dimension is given (with no direct relevance to cuttings, however).
0 references
computational geometry
0 references
hyperplane arrangement
0 references
cutting
0 references
simplex
0 references
divide- and-conquer
0 references
segment intersection
0 references
line/point incidence
0 references
linear programming
0 references
point location
0 references
epsilon-net
0 references
deterministic algorithm
0 references
0 references
0 references
0 references
0.8964662551879883
0 references
0.8955646753311157
0 references
0.8531121611595154
0 references
0.8531121611595154
0 references
0.8353690505027771
0 references
