Show simple item record

dc.contributor.advisorZyda, Michael J.
dc.contributor.authorHogan, Patrick G.
dc.dateDecember 1985
dc.date.accessioned2012-11-27T00:02:55Z
dc.date.available2012-11-27T00:02:55Z
dc.date.issued1985-12
dc.identifier.urihttp://hdl.handle.net/10945/21566
dc.descriptionApproved for public release; distribution is unlimited
dc.description.abstractMany scientific and technical endeavors require the reconstruction of a three-dimensional solid from a collection of two-dimensional contours. One method for this reconstruction involves a procedure whereby individual pairs of contours are mapped together to form triangular surface patches. In this paper, we present an algorithm which not only handles mapping situations of simple, closed contours but also mappings of multiple contours per plane and partial contour mappings. Also included is a discussion of algorithm limitations and heuristics.
dc.description.urihttp://archive.org/details/surfaceconstruct00hoga
dc.format.extent61 p.en_US
dc.language.isoen_US
dc.rightsThis publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.
dc.rightscomputer graphics
dc.rightstriangulation
dc.rightsheuristic methods
dc.rightscontour data
dc.subject.lcshComputer scienceen_US
dc.titleSurface construction from planar contours.en_US
dc.typeThesisen_US
dc.contributor.secondreaderWu, C. Thomas
dc.contributor.corporateNaval Postgraduate School (U.S.)
dc.contributor.departmentComputer Science
dc.description.serviceLieutenant Commander, United States Navy
etd.thesisdegree.nameM.S. in Computer Scienceen_US
etd.thesisdegree.levelMastersen_US
etd.thesisdegree.disciplineComputer Scienceen_US
etd.thesisdegree.grantorNaval Postgraduate Schoolen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record