Geometric computing and uniform grid technique

Date

1989

Authors

Akman, W.
Franklin, W. R.
Kankanhalli, M.
Narayanaswami, C.

Editor(s)

Advisor

Supervisor

Co-Advisor

Co-Supervisor

Instructor

Source Title

Computer-Aided Design

Print ISSN

0010-4485

Electronic ISSN

Publisher

Elsevier

Volume

21

Issue

7

Pages

410 - 420

Language

English

Journal Title

Journal ISSN

Volume Title

Series

Abstract

If 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.

Course

Other identifiers

Book Title

Citation