Optimal deterministic algorithms for 2-d and 3-d shallow cuttings (Q728495)
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 6666306
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal deterministic algorithms for 2-d and 3-d shallow cuttings |
scientific article; zbMATH DE number 6666306 |
Statements
Optimal deterministic algorithms for 2-d and 3-d shallow cuttings (English)
0 references
20 December 2016
0 references
shallow cuttings
0 references
derandomization
0 references
halfspace range reporting
0 references
geometric data structures
0 references
0 references
0 references
0.997548520565033
0 references
0.880820095539093
0 references
0.8752666711807251
0 references
0.849480390548706
0 references
0.8477929830551147
0 references
