Algorithms for manipulating triangulated surfaces

Simple item page
dc.contributor.advisorSimpson, Anne L.
dc.contributor.committeeMemberElmasri, Ramez A.
dc.contributor.committeeMemberSanders, Richard
dc.creatorYiu, Dang-Cheng
dc.date.accessioned2024-04-22T20:17:34Z
dc.date.available2024-04-22T20:17:34Z
dc.date.issued1987
dc.description.abstractTriangulations are powerful tools for surface modeling. They can be used to fit any irregular boundary shapes and surface discontinuity fault patterns. However, without the help of row and column information as in rectangular grids, manipulating a triangulated surface interactively is not an easy task. Efficiency is a major concern for manipulation functions. This article will propose some algorithms to manipulate triangulated surfaces such as: finding the path of a given route in a triangulated surface; getting the profile of a vertex function along a given route; and partitioning a surface domain by vertical plane(s). These algorithms have applications to interactive graphics where the user wishes to slice multisurface folds to obtain various views of a solid, and to dynamical problems where one wishes to introduce fracture systems into pre-existing surfaces. Some other useful operations such as merging of two domains, moving a vertex with preset rules, and combined use with rectangular grids, are also discussed. The proposed algorithms have been implemented in a triangulation database system developed by W.M. Smith of Cullen Image Processing Laboratory at University of Houston. This process requires both expansion and modification of Smith’s system. The principal modification introduced enables the system to treat multiple surfaces in main memory rather than only one surface at a time from a file database. The algorithms can be applied to any multi-connected surface domain. Holes and irregular boundary conditions are given careful treatment A theoretical analysis of time complexity is not available at this stage. Empirical results for the time required by these algorithms are given instead.
dc.description.departmentComputer Science, Department of
dc.format.digitalOriginreformatted digital
dc.format.mimetypeapplication/pdf
dc.identifier.other17896915
dc.identifier.urihttps://hdl.handle.net/10657/17026
dc.language.isoen
dc.rightsThis item is protected by copyright but is made available here under a claim of fair use (17 U.S.C. Section 107) for non-profit research and educational purposes. Users of this work assume the responsibility for determining copyright status prior to reusing, publishing, or reproducing this item for purposes other than what is allowed by fair use or other copyright exemptions. Any reuse of this item in excess of fair use or other copyright exemptions requires express permission of the copyright holder.
dc.subjectTopographical surveying--Data processing
dc.subjectTriangulation--Data processing
dc.subjectSurfaces--Data processing
dc.titleAlgorithms for manipulating triangulated surfaces
dc.type.dcmiText
dc.type.genreThesis
thesis.degree.collegeCollege of Natural Sciences and Mathematics
thesis.degree.departmentComputer Science, Department of
thesis.degree.disciplineComputer Science
thesis.degree.grantorUniversity of Houston
thesis.degree.levelMasters
thesis.degree.nameMaster of Science

Files

Original bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
Yiu_1987_17896915.pdf
Size:
4.97 MB
Format:
Adobe Portable Document Format
Download

Collections

Legacy Theses and Dissertations (1940-2009)