The following pages link to Dynamic fractional cascading (Q908708):
Displaying 43 items.
- An efficient algorithm for computing least cost paths with turn constraints (Q293389) (← links)
- Efficient algorithms for the temporal precedence problem (Q293412) (← links)
- On the representation of the search region in multi-objective optimization (Q319674) (← links)
- Sequential dependency computation via geometric data structures (Q390107) (← links)
- Computing the map of geometric minimal cuts (Q476438) (← links)
- Efficient authenticated data structures for graph connectivity and geometric search problems (Q548654) (← links)
- Ordered theta graphs (Q598550) (← links)
- Energy-efficient paths in radio networks (Q639290) (← links)
- Maximizing the number of obnoxious facilities to locate within a bounded region (Q733537) (← links)
- Hidden line elimination for isooriented rectangles (Q911768) (← links)
- Maintaining the minimal distance of a point set in polylogarithmic time (Q1189290) (← links)
- Output-sensitive generation of the perspective view of isothetic parallelepipeds (Q1194332) (← links)
- Dynamic output-sensitive hidden surface removal for \(c\)-oriented polyhedra (Q1196293) (← links)
- Upper envelope onion peeling (Q1199830) (← links)
- New results on binary space partitions in the plane (Q1370930) (← links)
- Enhanced layered segment trees: a pragmatic data structure for real-time processing of geometric objects (Q1860195) (← links)
- Optimal bounds for the predecessor problem and related problems (Q1869935) (← links)
- An algorithm for handling many relational calculus queries efficiently. (Q1872707) (← links)
- I/O-efficient dynamic planar point location (Q1882856) (← links)
- Lower bounds for intersection searching and fractional cascading in higher dimension (Q1887711) (← links)
- Optimal cooperative search in fractional cascaded data structures (Q1907234) (← links)
- Algorithmic aspects of proportional symbol maps (Q1957642) (← links)
- Active-learning a convex body in low dimensions (Q2032355) (← links)
- Online recognition of dictionary with one gap (Q2216131) (← links)
- Efficient construction of a bounded-degree spanner with low weight (Q2365175) (← links)
- Near-linear approximation algorithms for geometric hitting sets (Q2429345) (← links)
- Space efficient dynamic orthogonal range reporting (Q2461544) (← links)
- The Maximum Disjoint Routing Problem (Q2817875) (← links)
- Mixed Map Labeling (Q2947031) (← links)
- Fast computation of a string duplication history under no-breakpoint-reuse (Q2955628) (← links)
- Efficient Top-k Queries for Orthogonal Ranges (Q3078389) (← links)
- Range-Aggregate Queries Involving Geometric Aggregation Operations (Q3078390) (← links)
- EXTERNAL MEMORY ORTHOGONAL RANGE REPORTING WITH FAST UPDATES (Q3459358) (← links)
- Towards an Optimal Method for Dynamic Planar Point Location (Q4562277) (← links)
- Output-sensitive generation of the perspective view of isothetic parallelepipeds (Q5056093) (← links)
- Fractional cascading simplified (Q5056142) (← links)
- Persistence, randomization and parallelization: On some combinatorial games and their applications (abstract) (Q5060121) (← links)
- Dynamic Planar Point Location in External Memory. (Q5088984) (← links)
- Point Location in Incremental Planar Subdivisions. (Q5091043) (← links)
- (Q5115793) (← links)
- Approximate Range Queries for Clustering (Q5116522) (← links)
- (Q5874486) (← links)
- Optimizing active ranges for consistent dynamic map labeling (Q5902232) (← links)
