Show simple item record

dc.contributor.advisorHazlewood, Carol
dc.contributor.authorCollins, Brian J. ( )
dc.date.accessioned2020-04-14T15:52:49Z
dc.date.available2020-04-14T15:52:49Z
dc.date.issued1997-08
dc.identifier.citationCollins, B. J. (1997). Implementation of an algorithm to approximate constrained tetrahedrizations with pre-specified triangular faces (Unpublished thesis). Southwest Texas State University, San Marcos, Texas.
dc.identifier.urihttps://digital.library.txstate.edu/handle/10877/9612
dc.description.abstractA tetrahedrization is a decomposition of a region in space into tetrahedra. It is not always possible to construct a tetrahedrization that contains prespecified facets. There is an unimplemented algorithm for producing a reasonably efficient approximate solution. Given points and triangles that intersect in (possibly empty) mutual faces, a binary space partition is used to define subregions of the convex hull of the input. The planar boundary faces of these subregions are triangulated with constraints, and the subregions are covered with tetrahedra that preserve the boundary triangles. The constraints are such that the set of tetrahedra is a tetrahedrization and the specified triangles are unions of facets of tetrahedra. An Object-Oriented analysis, an Object-Oriented design, and a C++ implementation of an algorithm to split the convex hull of a finite set of points by a plane is presented.
dc.formatText
dc.format.extent183 pages
dc.format.medium1 file (.pdf)
dc.language.isoen
dc.subjectTetrahedra
dc.subjectAlgorithms
dc.subjectSurfaces
dc.subjectConvex sets
dc.titleImplementation of an Algorithm to Approximate Constrained Tetrahedrizations with Pre-specified Triangular Faces
txstate.documenttypeThesis
thesis.degree.departmentComputer Science
thesis.degree.grantorSouthwest Texas State University
thesis.degree.levelMasters
thesis.degree.nameMaster of Science
txstate.accessrestricted
dc.description.departmentComputer Science


Download

This item is restricted to the Texas State University community. TXST affiliated users can access the item with their NetID and password authentication. Non-affiliated individuals should request a copy through their local library’s interlibrary loan service.

This item appears in the following Collection(s)

Show simple item record