Document Type

Graduate Research

Degree

Master of Science

Publication Date

7-1-1988

Abstract

This paper discusses a method which can be employed on a computer to allow the computer to perform Boolean operations on polygons and polyhedrons. Although current literature is full of algorithms which are vital in the construction of such a program, not many complete algorithms are available. The method described here employs several of the current algorithms and joins them together with other information to produce a complete package. The objects are stored using a boundary representation in linked lists. The polyhedrons are represented by the polygons that compose their faces . The polygons are processed by intersecting each line segment of a given polygon with all of the line segments the other polygon. The new line segments, induced by these intersections, are introduced and the fundamental cycles of the graph evaluated as to the region they bound and selected accordingly.

Comments

v, 34 leaves : ill. ; 28 cm. Bibliography: leaf 34.

Download

Share

COinS