Communications of the ACM · 1980 · 174 citations · 8 references
ComputingComputer ScienceComputer SystemsAlgorithmsComputational GeometryData StructuresBoundary RepresentationGeometric ApproximationGeometry ProcessingExecution Time AnalysisOctree DecompositionQuadtreesTree AlgorithmsTree Codes
An algorithm is presented for constructing a quadtree for a region given its boundary in the form of a chain code. Analysis of the algorithm reveals that its execution time is proportional to the product of the perimeter and the log of the diameter of the region.
8
Revised report on the algorithmic language ALGOL 60
John Backus, Friedrich L. Bauer, J. Green et al. · Communications of the ACM · 1963 · 909 citations · Full text
Report on the algorithmic language ALGOL 60
John Backus, Friedrich L. Bauer, J. Green et al. · Communications of the ACM · 1960 · 495 citations · Full text
Charles R. Dyer, Azriel Rosenfeld, Hanan Samet · Communications of the ACM · 1980 · 144 citations · Full text
Efficient computation and data structures for graphics.
Gregory M. Hunter · 1978 · 121 citations