Thesis. 1975. M.Arch.A.S.--Massachusetts Institute of Technology. Dept. of Architecture. / Bibliography: leaves 101-144. / by Anne Marie Fourcade. / M.Arch.A.S.

Thesis. 1975. M.Arch.--Massachusetts Institute of Technology. Dept. of Architecture. / Bibliography: leaves 51-52. / M.Arch.

Lai Yuen-hoo. / Thesis submitted in: November 2004. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2005. / Includes bibliographical references (leaves 100-102). / Abstracts in English and Chinese. / Abstract --- p.i / 摘要 --- p.ii / Acknowledgment --- p.iii / List of Figures --- p.iv / Table of Content --- p.vii / Chapter 1. --- Introduction --- p.1 / Chapter 1.1. --- Problem Definition --- p.1 / Chapter 1.2. --- Proposed Solution --- p.2 / Chapter 1.3. --- Thesis Contributions --- p.2 / Chapter 2. --- Modeling Approaches --- p.4 / Chapter 2.1. --- Polygon Modeling --- p.4 / Chapter 2.2. --- Patch Modeling --- p.6 / Chapter 2.3. --- Freehand Sketch-based Modeling --- p.7 / Chapter 2.4. --- Template Based Modeling --- p.8 / Chapter 2.5. --- Curve Interpolation Method --- p.9 / Chapter 3. --- Surface Operations --- p.11 / Chapter 3.1. --- Surface Blending --- p.11 / Chapter 3.2. --- Surface Trimming --- p.13 / Chapter 3.3. --- Boolean Operations --- p.14 / Chapter 4. --- Subdivision Surface --- p.16 / Chapter 4.1. --- Basic Principle --- p.16 / Chapter 4.2. --- Catmull-Clark Surface --- p.17 / Chapter 5. --- Modeling Algorithm Overview --- p.21 / Chapter 6. --- Subdivision Surface Generation --- p.23 / Chapter 6.1. --- Input Curves --- p.23 / Chapter 6.2. --- Surface Sweeping --- p.24 / Chapter 6.3. --- Subdivision Surface Fitting --- p.29 / Chapter 7. --- Surface Blending --- p.32 / Chapter 7.1. --- Introduction --- p.32 / Chapter 7.2. --- Problem Definition --- p.32 / Chapter 7.3. --- Algorithm Overview --- p.36 / Chapter 7.4. --- Blend Region Detection --- p.39 / Chapter 7.4.1. --- Collision Detection --- p.40 / Chapter 7.4.2. --- Result and Analysis --- p.42 / Chapter 7.5. --- "Mesh Refinement, Surface Fitting and Region Removal" --- p.46 / Chapter 7.5.1. --- Mesh Refinement --- p.46 / Chapter 7.5.1.1. --- Adaptive Subdivision --- p.46 / Chapter 7.5.1.2. --- Additional Subdivision Constraint --- p.47 / Chapter 7.5.2. --- Surface Fitting --- p.49 / Chapter 7.5.2.1. --- General Approach --- p.49 / Chapter 7.5.2.2. --- Surface Point Correspondence --- p.50 / Chapter 7.5.2.3. --- Numerical Fitting Method --- p.51 / Chapter 7.5.3. --- Unwanted Region Removal --- p.55 / Chapter 7.5.4. --- Result and Analysis --- p.56 / Chapter 7.6. --- Boundary Smoothing --- p.58 / Chapter 7.6.1. --- General Approach --- p.59 / Chapter 7.6.2. --- Constraint on Deformation Direction of Vertex --- p.61 / Chapter 7.6.3. --- Result and Analysis --- p.63 / Chapter 7.7. --- Blend Curves --- p.65 / Chapter 7.7.1. --- Problem Definition --- p.65 / Chapter 7.7.2. --- Proposed Solution Overview --- p.66 / Chapter 7.7.3. --- Maintenance of Regular Vertex Valence along Blend Curve --- p.67 / Chapter 7.7.3.1. --- Pairing Up Blend Boundary Vertices --- p.70 / Chapter 7.7.4. --- Minimization of Distortion Caused by Extraordinary Vertices --- p.72 / Chapter 7.7.5. --- Blend Vertex Position Optimization Function --- p.74 / Chapter 7.7.5.1. --- Face Normal Expression --- p.74 / Chapter 7.7.5.2. --- Face Normal Difference Energy Function --- p.77 / Chapter 7.7.5.3. --- Midpoint Distance Energy Function --- p.78 / Chapter 7.7.5.4. --- Weighted Least Square Energy Minimization --- p.78 / Chapter 8. --- Implementation --- p.81 / Chapter 8.1. --- Data Structure --- p.81 / Chapter 8.2. --- User Interface --- p.82 / Chapter 9. --- Results --- p.83 / Chapter 9.1. --- Surface Generation --- p.83 / Chapter 9.2. --- Surface Blending --- p.86 / Chapter 9.2.1. --- Ideal Case --- p.86 / Chapter 9.2.2. --- Angle of Insertion --- p.87 / Chapter 9.2.3. --- Surface Feature Near Intersection --- p.88 / Chapter 9.2.4. --- Comparison --- p.89 / Chapter 9.2.5. --- Other Examples --- p.92 / Chapter 9.3. --- Overall Performance --- p.94 / Chapter 9.4. --- Limitations --- p.97 / Chapter 9.4.1. --- Limitation on Generated Shape --- p.97 / Chapter 9.4.2. --- Limitation on Input Surfaces --- p.98 / Chapter 10. --- Conclusion and Future Work --- p.99 / References --- p.100

Real-time performance is necessary for video-rate processing. By utilizing GPU for acceleration, we propose an efficient technique for the warped display of surveillance video signal. Usually, there are regions of interest (ROIs) in video surveillance, such as entrance or exit, and moving objects or persons. The ii surveillant wants to see more of the ROIs, but also wants to have an overview of the whole surveillance scope. The warped display solves this conflict by locally zooming in the ROIs. / The above warped-display technique may not be able to capture more information. It only provides an efficient way to display the captured frame. To solve this problem, we propose a novel technique to automatically adjust the exposure and capture more information. Traditional automatic exposure control (AEC) is usually based on the intensity level. On the other hand, our technique is based on the information theory and the amount of information is measured by Shannon entropy. The computation of entropy is accelerated by GPU to achieve the video-rate performance. / Volume rendering is another hot research area. In this area, isosurfaces have been widely adopted to reveal the complex structures in volumetric data, due to its fine visual quality. We describe a GPU-based marching cubes (MC) algorithm to visualize multiple translucent isosurfaces. With the proposed parallel algorithm, we can naturally generate triangles in order, which facilitates the visibility-correct visualization of multiple translucent isosurfaces without computationally expensive sorting. Upon a commodity GPU, our implementation can extract isosurfaces from a high-resolution volume in real time and render the result. / We first present a GPU-friendly image rendering framework, which can achieve a wide range of non-photorealistic rendering (NPR) effects. Most of these effects usually require the tailor-made algorithms. By feeding with constant kernels, the usage of our framework is as simple as that of discrete linear filtering. However, our framework is non-linear and hence can mimic complex NPR effects, such as watercolor, painting, sketching, and so on. The core of our framework is the cellular neural networks (CNN). By relaxing the constraints in the traditional CNN, we demonstrate that various interesting and convincing results can be obtained. As CNN is locally connected and designed for massively parallel hardware, it fits nicely into the GPU hardware and the performance is improved a lot. / With the development of graphics processing unit (GPU), it is more and more efficient to solve complex algorithms with GPU because of its highly parallel structure and fast floating point operations. These complex algorithms were usually implemented with CPU previously. In this thesis, we propose several GPU-friendly concepts and algorithms to address some problems of visual computing, including: image rendering, video rendering, and volume rendering. / Wang Guangyu. / "September 2007." / Advisers: Pheng Am Heng; Tien-Tsin Wong. / Source: Dissertation Abstracts International, Volume: 69-08, Section: B, page: 4865. / Thesis (Ph.D.)--Chinese University of Hong Kong, 2007. / Includes bibliographical references (p. 115-131). / Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Electronic reproduction. [Ann Arbor, MI] : ProQuest Information and Learning, [200-] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Abstracts in English and Chinese. / School code: 1307.

Chu, Alan. / "October 2010." / Thesis (M.Phil.)--Chinese University of Hong Kong, 2011. / Includes bibliographical references (leaves 74-80). / Abstracts in English and Chinese. / Chapter 1 --- Introduction --- p.2 / Chapter 1.1 --- Motivation --- p.3 / Chapter 2 --- Background --- p.4 / Chapter 2.1 --- OpenGL and OpenGL Shading Language --- p.4 / Chapter 2.2 --- 4D Visualization --- p.6 / Chapter 2.2.1 --- 3-manifold as Surface for 4D Objects --- p.7 / Chapter 2.2.2 --- Visualizing 4D Objects in Euclidean 3-space --- p.8 / Chapter 2.2.3 --- The 4D Rendering Pipeline --- p.9 / Chapter 3 --- Related Work --- p.11 / Chapter 3.1 --- General Purpose Processing on Graphics Processing Units --- p.11 / Chapter 3.2 --- Volume Rendering --- p.12 / Chapter 3.2.1 --- Indirect Volume Rendering --- p.13 / Chapter 3.2.2 --- Direct Volume Rendering on Structured Grid --- p.13 / Chapter 3.2.3 --- Direct Volume Rendering on Unstructured Grid --- p.18 / Chapter 3.2.4 --- Acceleration of DVR --- p.19 / Chapter 3.3 --- 4D Visualization --- p.22 / Chapter 4 --- GL4D: Hardware Accelerated Interactive 4D Visualization --- p.26 / Chapter 4.1 --- Preprocessing: Prom Equations to Tetrahedral Mesh --- p.28 / Chapter 4.2 --- Core Rendering Pipeline: OpenGL for 4D Rendering --- p.29 / Chapter 4.2.1 --- Vertex Data Upload --- p.30 / Chapter 4.2.2 --- Slice-based Multi-pass Tetrahedral Mesh Rendering --- p.30 / Chapter 4.2.3 --- Back-to-front Composition --- p.38 / Chapter 4.3 --- Advanced Visualization Features in GL4D --- p.38 / Chapter 4.3.1 --- Stereoscopic Rendering --- p.39 / Chapter 4.3.2 --- False Intersection Detection --- p.40 / Chapter 4.3.3 --- Transparent 4D Objects Rendering --- p.42 / Chapter 4.3.4 --- Optimization --- p.44 / Chapter 5 --- Results --- p.48 / Chapter 5.1 --- Data Sets --- p.48 / Chapter 5.1.1 --- 3-manifolds in E4´ؤM3 4 --- p.49 / Chapter 5.1.2 --- 2-manifolds in E4´ؤM2 4 --- p.50 / Chapter 5.2 --- Performance --- p.69 / Chapter 6 --- Conclusion --- p.71 / Chapter 7 --- Future Work --- p.72 / Bibliography --- p.74

Typescript (photocopy). / Digitized by Kansas Correctional Industries

Thesis. 1978. M.Arch.A.S.--Massachusetts Institute of Technology. Dept. of Architecture. / MICROFICHE COPY AVAILABLE IN ARCHIVES AND ROTCH. / Bibliography: p. 81-84. / by Louis Weitzman. / M.Arch.A.S.

Wang, Yingze. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2009. / Includes bibliographical references (leaves 42-47). / Abstract also in Chinese. / Chapter 1 --- Introduction --- p.1 / Chapter 2 --- Related Work --- p.5 / Chapter 2.1 --- Line labeling and realization problem --- p.5 / Chapter 2.2 --- 3D reconstruction from multiple views --- p.6 / Chapter 2.3 --- 3D reconstruction from single line drawings --- p.7 / Chapter 2.3.1 --- Face identification from the line drawings --- p.7 / Chapter 2.3.2 --- 3D geometry reconstruction --- p.9 / Chapter 2.4 --- Our research topic and contributions --- p.13 / Chapter 3 --- Reconstruction of Curved Manifold Objects --- p.14 / Chapter 3.1 --- Assumptions and terminology --- p.14 / Chapter 3.2 --- Reconstruction of curved manifold objects --- p.17 / Chapter 3.2.1 --- Distinguishing between curved and planar faces --- p.17 / Chapter 3.2.2 --- Transformation of Line Drawings --- p.20 / Chapter 3.2.3 --- Regularities --- p.23 / Chapter 3.2.4 --- 3D Wireframe Reconstruction --- p.26 / Chapter 3.2.5 --- Generating Curved Faces --- p.28 / Chapter 3.2.6 --- The Complete 3D Reconstruction Algorithm --- p.33 / Chapter 4 --- Experiments --- p.35 / Chapter 5 --- Conclusions and Future Work --- p.40 / Chapter 5.1 --- Conclusions --- p.40 / Chapter 5.2 --- Future work --- p.40 / Bibliography --- p.42

Words need a context to be understood. Visual patterns also need a context to convey their meaning. When patterns represent quantities in business graphics, decision makers (DMs) depend on contrasting visual contexts to discern patterns and discover relationships. Depending on the context in which DMs see trends, differences between two trends may point to a problem, to continuity, or to an opportunity. Can enhancing the context in computer graphics help DMs visualize problems? To answer this research question, three experiments were done in the field on computer graphics. One hundred five DMs tried 17 different contexts for time-series trends displayed on a microcomputer monitor. The research objective was to find out whether changing the context in graphics affected the decision efficiency (accuracy/response time) of DMs in determining relationships among trends. Essential for measuring the effect were interactive computer programs that displayed random trends in graphics of differing contexts, collected the DMs' answers to questions about the trends, and graded 1133 graphics based on the answers, response times, and trend data. The experimental results supported the hypothesis that computers can enhance the visual context surrounding time-series trends so that DMs can better visualize problems. Results were based on comparisons of DMs' decision efficiencies between trial graphics with differing contextual enhancements and based on answers to questions about the trial graphics. The results were tested with nonparametric statistics at the 0.05 significance level. Specific findings were: (1) Computer-supplied forecasts, as an enhancement, significantly helped DMs discover differences among trends. (2) Although not statistically significant, stratified presentation of trends and fading chartjunk tended to increase DMs' efficiencies. (3) Adding two colors, as an enhancement, made no difference in efficiency over black and white. (4) Paired trends in windows did not affect efficiency significantly. (5) Sequentially traced trends and composites of enhancements did not affect efficiency significantly. (6) DMs preferred stratified trends most and had the most confidence in graphics with fading context. They least liked and had the least confidence in black-and-white graphics.

No description available.