Book ChapterDOI
Cache Oblivious Distribution Sweeping
Gerth Stølting Brodal,Rolf Fagerberg +1 more
- pp 426-438
Reads0
Chats0
TLDR
This work adapts the distribution sweeping model for divide-and-conquer algorithms to the cache oblivious model, and demonstrates by a series of algorithms the feasibility of the method in a cache oblivious setting.Abstract:
We adapt the distribution sweepingmetho d to the cache oblivious model. Distribution sweepingis the name used for a general approach for divide-and-conquer algorithms where the combination of solved subproblems can be viewed as a merging process of streams. We demonstrate by a series of algorithms for specific problems the feasibility of the method in a cache oblivious setting. The problems all come from computational geometry, and are: orthogonal line segment intersection reporting, the all nearest neighbors problem, the 3D maxima problem, computingthe measure of a set of axis-parallel rectangles, computingthe visibility of a set of line segments from a point, batched orthogonal range queries, and reportingpairwise intersections of axis-parallel rectangles. Our basic buildingblo ck is a simplified version of the cache oblivious sorting algorithm Funnelsort of Frigo et al., which is of independent interest.read more
Citations
More filters
Posted Content
String algorithms and data structures
TL;DR: This survey is aimed at illustrating the key ideas which should constitute, in this opinion, the current background of every index designer.
Journal ArticleDOI
Masking patterns in sequences: A new class of motif discovery with don't cares
TL;DR: A new notion of motifs, called masks, is introduced that succinctly represents the repeated patterns for an input sequence T of n symbols drawn from an alphabet @S, and how to build the set of all frequent maximal masks of length L in O(2^Ln) time and space using the Karp-Miller-Rosenberg approach.
Journal ArticleDOI
Optimal Cache-Oblivious Mesh Layouts
TL;DR: In this article, a cache-oblivious mesh update algorithm was proposed to guarantee that the mesh update has asymptotically optimal memory performance for any set of memory parameters.
Book ChapterDOI
Cache-Oblivious Red-Blue Line Segment Intersection
TL;DR: An optimal cache-oblivious algorithm for finding all intersections between a set of non-intersecting red segments and a set in the plane and the number of intersections is presented.
DissertationDOI
Traversing large graphs in realistic settings
TL;DR: A simple algorithm which maintains the topological order of a directed acyclic graph with n nodes under an online edge insertion sequence in O(n2.75) time, independent of the number m of edges inserted, an improvement over the previous best result of O(min{m 3 2 logn, m 3 2 +n2 logn}).
References
More filters
Book
Computer Architecture: A Quantitative Approach
TL;DR: This best-selling title, considered for over a decade to be essential reading for every serious student and practitioner of computer design, has been updated throughout to address the most important trends facing computer designers today.
Computational geometry. an introduction
TL;DR: This book offers a coherent treatment, at the graduate textbook level, of the field that has come to be known in the last decade or so as computational geometry.
Book
Computational Geometry: Algorithms and Applications
TL;DR: In this article, an introduction to computational geometry focusing on algorithms is presented, which is related to particular applications in robotics, graphics, CAD/CAM, and geographic information systems.
Book
Computational Geometry: An Introduction
TL;DR: In this article, the authors present a coherent treatment of computational geometry in the plane, at the graduate textbook level, and point out the way to the solution of the more challenging problems in dimensions higher than two.
Journal ArticleDOI
An efficient algorith for determining the convex hull of a finite planar set
TL;DR: P can be chosen to I&E the centroid oC the triangle formed by X, y and z and Express each si E S in polar coordinates th origin P and 8 = 0 in the direction of zu~ arhitnry fixed half-line L from P.