Author: | Lau, Chi-ngong Angus |
Title: | An optimization approach to subdivision mesh construction |
Degree: | M.Sc. |
Year: | 2000 |
Subject: | Numerical grid generation (Numerical analysis) Hong Kong Polytechnic University -- Dissertations |
Department: | Multi-disciplinary Studies Department of Computing |
Pages: | v, 67 leaves : ill. ; 30 cm |
Language: | English |
Abstract: | Today's automatic acquisition devices (e.g. laser scanners) are capable to generate complex three-dimensional meshes composed of hundreds of thousands of triangular surfaces. Although modem desktop computers provide high processing power and large storage at low cost, reduction of resolution is required for speedy rendering and animating those meshes. [LOU97] introduced subdivision wavelet transform (SWT) based multiresolution approach to approximate surface meshes to provide fair data compression. In order to apply this transformation, one needs to construct a series of subdivision meshes. In this dissertation, we propose a construction algorithm based on simulated annealing optimization algorithm to convert arbitrary meshes into subdivision meshes. In particular, we propose to optimize some metrics, which are employed for measuring the goodness of the subdivision mesh based on geometrical properties of individual topology type and resemblance to the original mesh. In addition, we develop a seed growing based remeshing algorithm to produce a coarse initial mesh so that a set of subdivision mesh can be generated for the application of SWT. |
Rights: | All rights reserved |
Access: | restricted access |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
b15276478.pdf | For All Users (off-campus access for PolyU Staff & Students only) | 2.96 MB | Adobe PDF | View/Open |
Copyright Undertaking
As a bona fide Library user, I declare that:
- I will abide by the rules and legal ordinances governing copyright regarding the use of the Database.
- I will use the Database for the purpose of my research or private study only and not for circulation or further reproduction or any other purpose.
- I agree to indemnify and hold the University harmless from and against any loss, damage, cost, liability or expenses arising from copyright infringement or unauthorized usage.
By downloading any item(s) listed above, you acknowledge that you have read and understood the copyright undertaking as stated above, and agree to be bound by all of its terms.
Please use this identifier to cite or link to this item:
https://theses.lib.polyu.edu.hk/handle/200/3554