An algorithm for determining the convex hull of N points in 3-space

Graduate Thesis Or Dissertation

Public Deposited

Citeable URL: https://ir.library.oregonstate.edu/concern/graduate_thesis_or_dissertations/6969z386q

Descriptions

Attribute Name	Values
Creator	Butler, Karen Jensen
Abstract	An algorithm is described for determining the vertices and supporting planes (or lines) of the convex hull of a given set of N distinct points in 3-space. The method involves determining a finite sequence of convex hulls, each successive convex hull being a better approximation to the convex hull of the given N points. The final convex hull being the one desired. The algorithm is programmed in Fortran I for an IBM 1620 with 40,000 positions of numeric storage. These programs and several examples are included, along with proofs for a few of the theorems necessary in the development of the algorithm.
Resource Type	Masters Thesis
Date Available	2014-05-30T18:03:07+00:00
Date Issued	1963-06-07
Degree Level	Master's
Degree Name	Master of Science (M.S.)
Degree Field	Mathematics
Degree Grantor	Oregon State University
Commencement Year	1964
Advisor	Stalley, Robert D.
Academic Affiliation	Mathematics
Non-Academic Affiliation	Oregon State University. Graduate School
Subject	Convex surfaces Groups of points Algorithms
Déclaration de droits	Copyright Not Evaluated
Publisher	Oregon State University
Peer Reviewed	No
Language	English [eng]
Digitization Specifications	File scanned at 300 ppi using Capture Perfect 3.0 on a Canon DR-9050C in PDF format. CVista PdfCompressor 5.0 was used for pdf compression and textual OCR.
Replaces	http://hdl.handle.net/1957/48642

Parents:

This work has no parents.

Dans Collection:

La vignette	Titre	Date de téléchargement	Visibilité	actes
	ButlerKarenJ1964.pdf	2017-08-16	Public	Télécharger