1012 search results - page 19 / 203 » Segment intersection searching problems in general settings |
148
Voted
FAW
2008
Springer
15 years 5 months ago
2008
Springer
We propose path-merging as a refinement of techniques used to make linked data structures partially persistent. Path-merging supports bursts of operations between any two adjacent ...
114
Voted
SODA
2001
ACM
15 years 5 months ago
2001
ACM
Recently, Har-Peled [HP99b] presented a new randomized technique for online construction of the zone of a curve in a planar arrangement of arcs. In this paper, we present several ...
135
Voted
COMPGEOM
1995
ACM
15 years 7 months ago
1995
ACM
The range searching problem is a fundamental problem in computational geometry, with numerous important applications. Most research has focused on solving this problem exactly, bu...
146
Voted
JACM
2007
15 years 3 months ago
2007
We introduce exponential search trees as a novel technique for converting static polynomial space search structures for ordered sets into fully-dynamic linear space data structure...
104
click to vote
CPM
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Detecting historical recombination is an important computational problem which has received great attention recently. Due to recombination, input sequences form a mosaic,...