於參數化和特徵模型的變形中保持幾何特徵是CAD建模中一項新的挑戰。這篇論文提出了一個以限制為基礎去進行變形的系統。此系統結合了自由曲面和特徵模型建模的好處，而且容許更自由的工程設計。 / 本方法可分為三個主要步驟。以常用的變形技術去改變一個模型的形狀，包括自由變形及軸向變形，然後參數特徵會根據用戶的要求去分拆為一系列基本的限制，最後目標特徵將會以逐步增量的優化技術去重建。 / 這篇論文提出了一個逐步增量的方法為優化中提供導引。這個優化是於維持所有提供的限制下盡量減少變形後模型的改變。另外，於一組的限制中以一個基准為參考，能使本系統更有效的運行。最後，我們也會展示一些使用本系統以限制為基礎去進行變形的結果。 / To retain geometric features in the deformation of a parametric and feature-based model is a new challenge for CAD modeling. This thesis presents a constraints based deformation framework. This framework combines the advantage of free-form modeling with feature based modeling, and allows engineering design to be performed in a free-form manner. / The proposed method can be divided into three major steps. An object is deformed by common deformation techniques such as FFD and axial deformation. Parametric features are divided into systems of primitive constraints based on user specification. The targeting features are reconstructed by the use of incremental optimization technique. / An incremental constrained deformation is introduced. It is used to provide hints for the optimization. The optimization is to minimize the changes in the deformed model subjected to all the provided constraints. For a structural constraint specified with a group of constraints, it would be better to use a reference datum for all its component constraints. We show numerous results of constraints retained models using our framework. / Detailed summary in vernacular field only. / Detailed summary in vernacular field only. / Detailed summary in vernacular field only. / Tang, Wing Shing. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2013. / Includes bibliographical references (leaves 84-86). / Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Abstracts also in Chinese. / Chapter 1 --- INTRODUCTION --- p.3 / Chapter 1.1 --- Aims and Objectives --- p.4 / Chapter 1.2 --- Report Organization --- p.5 / Chapter 2 --- BACKGROUND AND LITERATURE REVIEW --- p.7 / Chapter 2.1 --- Mesh Editing Techniques --- p.7 / Chapter 2.1.1 --- Mesh Deformation Techniques --- p.7 / Chapter 2.1.2 --- Detail Preserving Techniques --- p.9 / Chapter 2.2 --- Optimization Techniques --- p.11 / Chapter 2.2.1 --- Optimization Techniques --- p.11 / Chapter 2.2.2 --- Linear Programming --- p.12 / Chapter 2.2.2.1 --- Simplex Method --- p.12 / Chapter 2.2.2.2 --- Interior Point Method --- p.12 / Chapter 2.2.2.2.1 --- Primal-Dual Interior Point Method --- p.13 / Chapter 2.2.3 --- Nonlinear Programming --- p.14 / Chapter 2.2.3.1 --- Sequential Quadratic Programming --- p.14 / Chapter 2.2.3.2 --- Reduced Gradient Methods --- p.14 / Chapter 2.2.3.3 --- Interior Point Methods --- p.15 / Chapter 2.2.4 --- Optimization Solver --- p.15 / Chapter 2.2.4.1 --- KNITRO --- p.16 / Chapter 3 --- SPECIFICATION OF CONSTRAINTS --- p.18 / Chapter 3.1 --- Constraints --- p.18 / Chapter 3.1.1 --- Constraints with Reference Points --- p.22 / Chapter 3.1.2 --- Constraints with Reference Variables --- p.24 / Chapter 3.1.3 --- Reference Vector Constraints --- p.26 / Chapter 3.1.4 --- Constraints with Reference Datum --- p.27 / Chapter 3.1.4.1 --- Planer Constraint with References --- p.28 / Chapter 3.1.4.2 --- Collinear Constraint with References --- p.29 / Chapter 3.1.4.3 --- Circular Constraint with References --- p.30 / Chapter 3.2 --- Redundant Constraints --- p.31 / Chapter 4 --- CONSTRAINED OPTIMZATION --- p.32 / Chapter 4.1 --- Objective Function --- p.32 / Chapter 4.2 --- Incremental Constrained Deformation --- p.39 / Chapter 4.3 --- The Scaling Problem --- p.43 / Chapter 5 --- CASE STUDIES --- p.44 / Chapter 5.1 --- Maintain Individual Engineering Features --- p.44 / Chapter 5.2 --- Maintain Pattern between Engineering Features --- p.49 / Chapter 5.3 --- Maintain Relationship between Engineering Features --- p.51 / Chapter 5.4 --- Implementation Issue --- p.66 / Chapter 6 --- TESTS AND RESULTS --- p.68 / Chapter 6.1 --- Constraints with References --- p.68 / Chapter 6.2 --- Level Of Detail --- p.71 / Chapter 6.3 --- Incremental Method --- p.73 / Chapter 6.4 --- Comparison --- p.76 / Chapter 7 --- FURTHER WORK AND CONCLUSIONS --- p.81 / Chapter 7.1 --- Recommendation for Further Work --- p.81 / Chapter 7.2 --- Conclusions --- p.82 / REFERENCES --- p.84

by Tung Lun Hsing. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1997. / Includes bibliographical references (leaves 80-84). / Abstract --- p.i / Acknowledgement --- p.ii / Chapter 1 --- Introduction --- p.1 / Chapter 2 --- Literature Survey --- p.8 / Chapter 2.1 --- The Freeman Chain Code Approach --- p.8 / Chapter 2.2 --- The Moment Approach --- p.10 / Chapter 2.3 --- The Rectangular Cover Approach --- p.12 / Chapter 2.4 --- The Potential-Based Approach --- p.15 / Chapter 2.5 --- The Normalized Coordinate System Approach --- p.17 / Chapter 2.6 --- The Hausdorff Distance Method --- p.20 / Chapter 2.7 --- The PCA Approach --- p.22 / Chapter 3 --- Binary Shape Descriptor --- p.26 / Chapter 3.1 --- Basic idea --- p.26 / Chapter 3.2 --- Standardized Binary String Descriptor --- p.27 / Chapter 3.3 --- Number of equivalent classes for n-gons --- p.28 / Chapter 4 --- The Two-Stage Framework --- p.30 / Chapter 5 --- Multi-Resolution Area Matching --- p.33 / Chapter 5.1 --- The idea --- p.33 / Chapter 5.2 --- Computing MRAI --- p.34 / Chapter 5.3 --- Measuring similarity using MRAI --- p.36 / Chapter 5.4 --- Query processing using MRAM --- p.38 / Chapter 5.5 --- Characteristics and Discussion --- p.40 / Chapter 6 --- Circular Error Bound and Minimum Circular Error Bound --- p.41 / Chapter 6.1 --- Polygon Matching using Circular Error Bound --- p.41 / Chapter 6.1.1 --- Translation --- p.43 / Chapter 6.1.2 --- Translation and uniform scaling in x-axis and y-axis directions --- p.45 / Chapter 6.1.3 --- Translation and independent scaling in x-axis and y-axis directions --- p.47 / Chapter 6.2 --- Minimum Circular Error Bound --- p.48 / Chapter 6.3 --- Characteristics --- p.49 / Chapter 7 --- Experimental Results --- p.50 / Chapter 7.1 --- Setup --- p.50 / Chapter 7.1.1 --- Polygon generation --- p.51 / Chapter 7.1.2 --- Database construction --- p.52 / Chapter 7.1.3 --- Query processing --- p.54 / Chapter 7.2 --- Running time comparison --- p.55 / Chapter 7.2.1 --- Experiment I --- p.55 / Chapter 7.2.2 --- Experiment II --- p.58 / Chapter 7.2.3 --- Experiment III --- p.60 / Chapter 7.3 --- Visual ranking comparison --- p.61 / Chapter 7.3.1 --- Experiment I --- p.61 / Chapter 7.3.2 --- Experiment II --- p.62 / Chapter 7.3.3 --- Experiment III --- p.63 / Chapter 7.3.4 --- Conclusion on visual ranking experiments --- p.66 / Chapter 8 --- Discussion --- p.68 / Chapter 8.1 --- N-ary Shape Descriptor --- p.68 / Chapter 8.2 --- Distribution of polygon equivalent classes --- p.69 / Chapter 8.3 --- Comparing polygons with different number of vertices --- p.72 / Chapter 8.4 --- Relaxation of assumptions --- p.73 / Chapter 8.4.1 --- Non-degenerate --- p.74 / Chapter 8.4.2 --- Simple --- p.74 / Chapter 8.4.3 --- Closed --- p.76 / Chapter 9 --- Conclusion --- p.78 / Bibliography --- p.80

published_or_final_version / abstract / toc / Computer Science and Information Systems / Master / Master of Philosophy

No description available.

No description available.

No description available.

No description available.

In recent years extensive research has been done on visibility graphs. In this thesis, we study some of the visibility graph algorithms, and implement these algorithms in the graph editor - GraphPerfect - which is a part of a project headed by Dr. Jay S. Bagga of the Department of computer science at Ball State University. One of the goals of this project is to design and build a software tool to learn and work with graphs and graph algorithms.In this thesis, some properties of visibility graphs are studied in detail and implementation of some graph algorithms is given. / Department of Computer Science

Title page, abstract and table of contents only. The complete thesis in print form is available from the University of Adelaide Library. / http://proxy.library.adelaide.edu.au/login?url= http://library.adelaide.edu.au/cgi-bin/Pwebrecon.cgi?BBID=1274742 / Thesis (Ph.D.) -- University of Adelaide, School of Psychology, 2007

No description available.