FSTTCS 2004 - PDF Preprint Papers

FSTTCS 2004 Foundations of Software Technology and Theoretical Computer Science

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed FSTTCS-2004 Paper

click to vote

FSTTCS
2004
Springer

157views Software Engineering» more FSTTCS 2004»

Approximate Range Searching Using Binary Space Partitions

14 years 5 months ago

Download www.win.tue.nl

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

claim paper

Read More »

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.

Related Conferences

Id	Views	Title	Status

1	157	Approximate Range Searching Using Binary Space Partitions	claim
2	154	Distributed Algorithms for Coloring and Domination in Wireless Ad Hoc Networks	claim
3	139	A Decidable Fragment of Separation Logic	claim
4	138	Who is Pointing When to Whom?	claim
5	132	Adaptive Stabilization of Reactive Protocols	claim
6	130	Learning Languages from Positive Data and a Finite Number of Queries	claim
7	125	Improved Approximation Algorithms for Maximum Graph Partitioning Problems	claim
8	111	Decidability of MSO Theories of Tree Structures	claim
9	107	A Calculus for Trust Management	claim
10	104	Testing Geometric Convexity	claim
11	99	Minimum Weight Pseudo-Triangulations	claim
12	97	Optimal Strategies in Priced Timed Game Automata	claim
13	96	Symbolic Reachability Analysis of Higher-Order Context-Free Processes	claim
14	96	Visibly Pushdown Games	claim
15	94	Refinement and Separation Contexts	claim
16	92	Real-Counter Automata and Their Decision Problems	claim
17	91	Adjunct Elimination Through Games in Static Ambient Logic	claim
18	89	Actively Learning to Verify Safety for FIFO Automata	claim
19	89	Alternation in Equational Tree Automata Modulo XOR	claim
20	87	Distributed Games with Causal Memory Are Decidable for Series-Parallel Systems	claim
21	85	Genome Halving Problem Revisited	claim
22	84	On the Complexity of Hilbert's 17th Problem	claim
23	83	Verifying Probabilistic Procedural Programs	claim
24	83	Hardness Hypotheses, Derandomization, and Circuit Complexity	claim
25	82	Expand, Enlarge, and Check: New Algorithms for the Coverability Problem of WSTS	claim
26	77	Representable Disjoint NP-Pairs	claim
27	76	Subdividing Alpha Complex	claim
28	74	Toward a Grainless Semantics for Shared-Variable Concurrency	claim
29	73	Short-Cuts on Star, Source and Planar Unfoldings	claim
30	64	Join Algorithms for the Theory of Uninterpreted Functions	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers