Akman, W.Franklin, W. R.Kankanhalli, M.Narayanaswami, C.2016-02-082016-02-0819890010-4485http://hdl.handle.net/11693/26241If computational geometry should play an important role in the professional environment (e.g. graphics and robotics), the data structures it advocates should be readily implemented and the algorithms efficient. In the paper, the uniform grid and a diverse set of geometric algorithms that are all based on it, are reviewed. The technique, invented by the second author, is a flat, and thus non-hierarchical, grid whose resolution adapts to the data. It is especially suitable for telling efficiently which pairs of a large number of short edges intersect. Several of the algorithms presented here exist as working programs (among which is a visible surface program for polyhedra) and can handle large data sets (i.e. many thousands of geometric objects). Furthermore, the uniform grid is appropriate for parallel processing; the parallel implementation presented gives very good speed-up results. © 1989.EnglishBoolean operations on polyhedraHaloed linesLine segment intersectionMap overlayParallel computational geometryPoint locationPolyhedral visibilityUniform gridMathematical TechniquesLine segment intersectionParallel computational geometryUniform grid techniqueComputer aided designArticle10.1016/0010-4485(89)90125-5