Simplifying polygonal models using successive mappings

dc.contributor.authorCohen, J.
dc.contributor.authorManocha, D.
dc.contributor.authorOlano, Marc
dc.date.accessioned2026-02-03T18:15:03Z
dc.date.issued1997-10
dc.descriptionIEEE Conference on Visualization, October 24,1997, Phoenix, AZ, USA
dc.description.abstractWe present the use of mapping functions to automatically generate levels of detail with known error bounds for polygonal models. We develop a piece-wise linear mapping function for each simplification operation and use this function to measure deviation of the new surface from both the previous level of detail and from the original surface. In addition, we use the mapping function to compute appropriate texture coordinates if the original map has texture coordinates at its vertices. Our overall algorithm uses edge collapse operations. We present rigorous procedures for the generation of local planar projections as well as for the selection of a new vertex position for the edge collapse operation. As compared to earlier methods, our algorithm is able to compute tight error bounds on surface deviation and produce an entire continuum of levels of detail with mappings between them. We demonstrate the effectiveness of our algorithm on several models: a Ford Bronco consisting of over 300 parts and 70,000 triangles, a textured lion model consisting of 49 parts and 86,000 triangles, and a textured, wrinkled torus consisting of 79,000 triangles.
dc.description.sponsorshipWe would like to thank Stanford Computer Graphics Laboratory for the bunny model, Stefan Gottschalk for the wrinkled torus model, Lifeng Wang and Xing Xing Computer for the lion model from the Yuan-Ming Garden, and Division and Viewpoint for the Ford Bronco model. Thanks to Michael Hohmeyer for the linear programming library. We would also like to thank the UNC Walkthrough Group and Carl Mueller. This work was supported in part by an Alfred P. Sloan Foundation Fellowship, ARO Contract DAAH04-96-1-0257, NSF Grant CCR-9319957, NSF Grant CCR-9625217, ONR Young Investigator Award, Intel, DARPA Contract DABT63-93-C-0048 and NSF/ARPA Center for Computer Graphics and Scientific Visualization.
dc.description.urihttps://ieeexplore.ieee.org/document/663908
dc.format.extent19 pages
dc.genreconference papers and proceedings
dc.genrepreprints
dc.identifierdoi:10.13016/m28wmt-ztng
dc.identifier.citationCohen, J., D. Manocha, and M. Olano. “Simplifying Polygonal Models Using Successive Mappings.” Proceedings. Visualization ’97 (Cat. No. 97CB36155), October 1997, 395–402. https://doi.org/10.1109/VISUAL.1997.663908.
dc.identifier.urihttps://doi.org/10.1109/VISUAL.1997.663908
dc.identifier.urihttp://hdl.handle.net/11603/41701
dc.language.isoen
dc.publisherIEEE
dc.relation.isAvailableAtThe University of Maryland, Baltimore County (UMBC)
dc.relation.ispartofUMBC College of Engineering and Information Technology Dean's Office
dc.relation.ispartofUMBC Computer Science and Electrical Engineering Department
dc.rights© 1997 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
dc.subjectInformation geometry
dc.subjectPiecewise linear techniques
dc.subjectComputer graphics
dc.subjectSolid modeling
dc.subjectSurface texture
dc.subjectUpper bound
dc.subjectChromium
dc.subjectCurrent measurement
dc.subjectUMBC Ebiquity Research Group
dc.subjectComputational geometry
dc.subjectLinear approximation
dc.titleSimplifying polygonal models using successive mappings
dc.typeText
dcterms.creatorhttps://orcid.org/0000-0003-4209-6103

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
succ_maptr.pdf
Size:
727.44 KB
Format:
Adobe Portable Document Format