Sciweavers

Share
FSTTCS   2004 Foundations of Software Technology and Theoretical Computer Science
Wall of Fame | Most Viewed FSTTCS-2004 Paper
FSTTCS
2004
Springer
9 years 3 months ago
Approximate Range Searching Using Binary Space Partitions
We show how any BSP tree TP for the endpoints of a set of n disjoint segments in the plane can be used to obtain a BSP tree of size O(n ยท depth(TP )) for the segments themselves, ...
Mark de Berg, Micha Streppel
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
IdReadViewsTitleStatus
1Download preprint from source157
2Download preprint from source154
3Download preprint from source139
4Download preprint from source138
5Download preprint from source132
6Download preprint from source130
7Download preprint from source125
8Download preprint from source111
9Download preprint from source107
10Download preprint from source104
11Download preprint from source99
12Download preprint from source97
13Download preprint from source96
14Download preprint from source96
15Download preprint from source94
16Download preprint from source92
17Download preprint from source91
18Download preprint from source89
19Download preprint from source89
20Download preprint from source87
21Download preprint from source85
22Download preprint from source84
23Download preprint from source83
24Download preprint from source83
25Download preprint from source82
26Download preprint from source77
27Download preprint from source76
28Download preprint from source74
29Download preprint from source73
30Download preprint from source64
books