Design Automation Conference · 1982 · 68 citations · 18 references
ComputingComputer ScienceGeoinformaticsData StructuresGeometric ModelingGeometryGeometric Data StructuresGeometry ProcessingSpatial Data StructuresSpatial Database SystemsSpatial DatabasesSpatial PartitioningGeometric Data ManagementGeometric Data ModelGeometric Data TypesGeometric PartitioningHidden Line EliminationK-nearest NeighborsNearest Neighbor GraphsPoint-based Data Structures
The extendible cell (EXCELL) method provides a data structure for efficient geometric access. It stores geometric data into computer storage blocksm corresponding to disjoint variable sized rectangular cells accessible by an address calculation type directory. We describe the method for point files and files of more complicated figures analyzing performance. We report algorithms for the nearest neighbour and point-in-polygon-network problems and describe applications to geographical data bases, hidden line elimination and geometric modeling.
18
Algorithms for Reporting and Counting Geometric Intersections
Bentley, Ottmann · IEEE Transactions on Computers · 1979 · 999 citations
Extendible hashing—a fast access method for dynamic files
Ronald Fagin, Jürg Nievergelt, Nicholas Pippenger et al. · ACM Transactions on Database Systems · 1979 · 669 citations · Full text
Ray casting for modeling solids
Scott D Roth · Computer Graphics and Image Processing · 1982 · 606 citations