Pages that link to "Item:Q2848977"
From MaRDI portal
The following pages link to Succinct and Implicit Data Structures for Computational Geometry (Q2848977):
Displaying 10 items.
- Speeding up the incremental construction of the union of geometric objects in practice. (Q1421031) (← links)
- Dynamic geometric data structures via shallow cuttings (Q2223621) (← links)
- Two approaches to building time-windowed geometric data structures (Q2319633) (← links)
- Encoding two-dimensional range top-\(k\) queries (Q2665908) (← links)
- Explicit Array-Based Compact Data Structures for Triangulations (Q3104626) (← links)
- (Q5088951) (← links)
- (Q5116481) (← links)
- Succinct Color Searching in One Dimension (Q5136249) (← links)
- Towards in-place geometric algorithms and data structures (Q5361676) (← links)
- Discrete and Computational Geometry (Q5897092) (← links)