Pages that link to "Item:Q1188530"
From MaRDI portal
The following pages link to Efficient structures for geometric data management (Q1188530):
Displaying 10 items.
- A dual approach to detect polyhedral intersections in arbitrary dimensions (Q758179) (← links)
- Minimum k-partitioning of rectilinear polygons (Q912618) (← links)
- Convex polyhedral chains: A representation for geometric data (Q1118964) (← links)
- On the decidability of semilinearity for semialgebraic sets and its implications for spatial databases (Q1307697) (← links)
- A hierarchical representation and computation scheme of arbitrary-dimensional geometrical primitives based on CGA (Q1695110) (← links)
- Dynamic geometric data structures via shallow cuttings (Q2223621) (← links)
- Two approaches to building time-windowed geometric data structures (Q2319633) (← links)
- Succinct and Implicit Data Structures for Computational Geometry (Q2848977) (← links)
- (Q5088951) (← links)
- On the expressiveness of linear-constraint query languages for spatial databases (Q5940929) (← links)