Efficient structures for geometric data management
From MaRDI portal
Publication:1188530
zbMath0662.68018MaRDI QIDQ1188530
Publication date: 17 September 1992
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
set operationsgeometric data structuresgarbage collectiontree structuresgeometric interrogation algorithms
Computing methodologies and applications (68U99) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Software, source code, etc. for problems pertaining to geometry (51-04) Data structures (68P05)
Related Items (4)
Minimum k-partitioning of rectilinear polygons ⋮ On the expressiveness of linear-constraint query languages for spatial databases ⋮ A dual approach to detect polyhedral intersections in arbitrary dimensions ⋮ On the decidability of semilinearity for semialgebraic sets and its implications for spatial databases
Uses Software
This page was built for publication: Efficient structures for geometric data management
