Dynamic fractional cascading
From MaRDI portal
Publication:908708
DOI10.1007/BF01840386zbMath0693.68038OpenAlexW2061750047WikidataQ30048731 ScholiaQ30048731MaRDI QIDQ908708
Publication date: 1990
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01840386
Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Computing methodologies and applications (68U99) Data structures (68P05)
Related Items
An algorithm for handling many relational calculus queries efficiently., Efficient construction of a bounded-degree spanner with low weight, I/O-efficient dynamic planar point location, An efficient algorithm for computing least cost paths with turn constraints, Efficient algorithms for the temporal precedence problem, Lower bounds for intersection searching and fractional cascading in higher dimension, Persistence, randomization and parallelization: On some combinatorial games and their applications (abstract), On the representation of the search region in multi-objective optimization, EXTERNAL MEMORY ORTHOGONAL RANGE REPORTING WITH FAST UPDATES, Optimal cooperative search in fractional cascaded data structures, Towards an Optimal Method for Dynamic Planar Point Location, New results on binary space partitions in the plane, Ordered theta graphs, Sequential dependency computation via geometric data structures, Mixed Map Labeling, Fast computation of a string duplication history under no-breakpoint-reuse, Unnamed Item, Near-linear approximation algorithms for geometric hitting sets, Point enclosure problem for homothetic polygons, Energy-efficient paths in radio networks, Hidden line elimination for isooriented rectangles, Algorithmic aspects of proportional symbol maps, Online recognition of dictionary with one gap, Computing the map of geometric minimal cuts, Space efficient dynamic orthogonal range reporting, Maintaining the minimal distance of a point set in polylogarithmic time, Output-sensitive generation of the perspective view of isothetic parallelepipeds, Dynamic output-sensitive hidden surface removal for \(c\)-oriented polyhedra, Upper envelope onion peeling, Optimizing active ranges for consistent dynamic map labeling, Efficient authenticated data structures for graph connectivity and geometric search problems, Output-sensitive generation of the perspective view of isothetic parallelepipeds, Active-learning a convex body in low dimensions, Maximizing the number of obnoxious facilities to locate within a bounded region, Efficient Top-k Queries for Orthogonal Ranges, Range-Aggregate Queries Involving Geometric Aggregation Operations, Unnamed Item, The Maximum Disjoint Routing Problem, Point Location in Incremental Planar Subdivisions., Dynamic Planar Point Location in External Memory., Approximate Range Queries for Clustering, Enhanced layered segment trees: a pragmatic data structure for real-time processing of geometric objects, Optimal bounds for the predecessor problem and related problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An O(n log n) Manhattan path algorithm
- Maintaining order in a generalized linked list
- A linear-time algorithm for a special case of disjoint set union
- Fast dynamic intersection searching in a set of isothetic line segments
- Fractional cascading. I: A data structuring technique
- Making data structures persistent
- On the average number of rebalancing operations in weight-balanced trees
- A new data structure for representing sorted lists
- Decomposable searching problems
- Finding a manhattan path and related problems
- New Data Structures for Orthogonal Range Queries
- Amortized Computational Complexity
- Optimal Point Location in a Monotone Subdivision
- Adding range restriction capability to dynamic data structures
- Dynamic orthogonal segment intersection search
- Rectilinear line segment intersection, layered segment trees, and dynamization
- Design and implementation of an efficient priority queue
