Dynamic fractional cascading
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3887059 (Why is no real title available?)
- scientific article; zbMATH DE number 3887060 (Why is no real title available?)
- scientific article; zbMATH DE number 3887061 (Why is no real title available?)
- scientific article; zbMATH DE number 3984593 (Why is no real title available?)
- scientific article; zbMATH DE number 43279 (Why is no real title available?)
- A linear-time algorithm for a special case of disjoint set union
- A new data structure for representing sorted lists
- Adding range restriction capability to dynamic data structures
- Amortized Computational Complexity
- An O(n log n) Manhattan path algorithm
- Decomposable searching problems
- Design and implementation of an efficient priority queue
- Dynamic orthogonal segment intersection search
- Fast dynamic intersection searching in a set of isothetic line segments
- Finding a manhattan path and related problems
- Fractional cascading. I: A data structuring technique
- Maintaining order in a generalized linked list
- Making data structures persistent
- New Data Structures for Orthogonal Range Queries
- On the average number of rebalancing operations in weight-balanced trees
- Optimal Point Location in a Monotone Subdivision
- Rectilinear line segment intersection, layered segment trees, and dynamization
Cited in
(47)- Lower bounds for intersection searching and fractional cascading in higher dimension
- The Maximum Disjoint Routing Problem
- Space efficient dynamic orthogonal range reporting
- Fractional Cascading Revisited
- Output-sensitive generation of the perspective view of isothetic parallelepipeds
- Online recognition of dictionary with one gap
- Efficient authenticated data structures for graph connectivity and geometric search problems
- Hidden line elimination for isooriented rectangles
- Output-sensitive generation of the perspective view of isothetic parallelepipeds
- Optimal cooperative search in fractional cascaded data structures
- Dynamic deferred data structuring
- Enhanced layered segment trees: a pragmatic data structure for real-time processing of geometric objects
- Fractional cascading. II: Applications
- Efficient construction of a bounded-degree spanner with low weight
- Efficient top-\(k\) queries for orthogonal ranges
- Dynamic output-sensitive hidden surface removal for \(c\)-oriented polyhedra
- Dynamic Planar Point Location in External Memory.
- Towards an optimal method for dynamic planar point location
- Active-learning a convex body in low dimensions
- Algorithmic aspects of proportional symbol maps
- Mixed Map Labeling
- Fast computation of a string duplication history under no-breakpoint-reuse
- Fractional cascading simplified
- Maintaining the minimal distance of a point set in polylogarithmic time
- Point enclosure problem for homothetic polygons
- Range-Aggregate Queries Involving Geometric Aggregation Operations
- I/O-efficient dynamic planar point location
- Ordered theta graphs
- Persistence, randomization and parallelization: On some combinatorial games and their applications (abstract)
- New results on binary space partitions in the plane
- Maximizing the number of obnoxious facilities to locate within a bounded region
- Point Location in Incremental Planar Subdivisions.
- Optimizing active ranges for consistent dynamic map labeling
- On the representation of the search region in multi-objective optimization
- Approximate range queries for clustering
- Sequential dependency computation via geometric data structures
- An algorithm for handling many relational calculus queries efficiently.
- An efficient algorithm for computing least cost paths with turn constraints
- Efficient algorithms for the temporal precedence problem
- Energy-efficient paths in radio networks
- Computing the map of geometric minimal cuts
- Dynamic planar orthogonal point location in sublogarithmic time
- Upper envelope onion peeling
- Optimal bounds for the predecessor problem and related problems
- Near-linear approximation algorithms for geometric hitting sets
- scientific article; zbMATH DE number 7651158 (Why is no real title available?)
- External memory orthogonal range reporting with fast updates
This page was built for publication: Dynamic fractional cascading
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q908708)
