A nearly quadratic bound for point-location in hyperplane arrangements, in the linear decision tree model (Q2415377)
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 7057358
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A nearly quadratic bound for point-location in hyperplane arrangements, in the linear decision tree model |
scientific article; zbMATH DE number 7057358 |
Statements
A nearly quadratic bound for point-location in hyperplane arrangements, in the linear decision tree model (English)
0 references
21 May 2019
0 references
point location in geometric arrangements
0 references
\(k\)-SUM and \(k\)-LDT
0 references
linear decision tree model
0 references
epsilon-cuttings
0 references
vertical decomposition of geometric arrangements
0 references
arrangement of hyperplanes
0 references
0 references
0 references
0 references
0.8328712582588196
0 references
0.8266279697418213
0 references
0.8151201605796814
0 references
0.8143937587738037
0 references
