Pages that link to "Item:Q1188530"
From MaRDI portal
The following pages link to Efficient structures for geometric data management (Q1188530):
Displayed 4 items.
- A dual approach to detect polyhedral intersections in arbitrary dimensions (Q758179) (← links)
- Minimum k-partitioning of rectilinear polygons (Q912618) (← links)
- On the decidability of semilinearity for semialgebraic sets and its implications for spatial databases (Q1307697) (← links)
- On the expressiveness of linear-constraint query languages for spatial databases (Q5940929) (← links)