A FLEXIBLE METHODOLOGY FOR OUTDOOR/INDOOR BUILDING RECONSTRUCTION FROM OCCLUDED POINT CLOUDS

Terrestrial Laser Scanning data are increasingly used in building survey not only in cultural heritage domain but also for as-built modelling of large and medium size civil structures. However, raw point clouds derived from laser scanning generally not directly ready for the generation of such models. A time-consuming manual modelling phase has to be taken into account. In addition the large presence of occlusion and clutter may turn out in low-quality building models when state-of-the-art automatic modelling procedures are applied. This paper presents an automated procedure to convert raw point clouds into semantically-enriched building models. The developed method mainly focuses on a geometrical complexity typical of modern buildings with clear prevalence of planar features A characteristic of this methodology is the possibility to work with outdoor and indoor building environments. In order to operate under severe occlusions and clutter a couple of completion algorithms were designed to generate a plausible and reliable model. Finally, some examples of the developed modelling procedure are presented and discussed

Arbitrary topology meshes in geometric design and vector graphics

Meshes are a powerful means to represent objects and shapes both in 2D and 3D, but the techniques based on meshes can only be used in certain regular settings and restrict their usage. Meshes with an arbitrary topology have many interesting applications in geometric design and (vector) graphics, and can give designers more freedom in designing complex objects. In the first part of the thesis we look at how these meshes can be used in computer aided design to represent objects that consist of multiple regular meshes that are constructed together. Then we extend the B-spline surface technique from the regular setting to work on extraordinary regions in meshes so that multisided B-spline patches are created. In addition, we show how to render multisided objects efficiently, through using the GPU and tessellation. In the second part of the thesis we look at how the gradient mesh vector graphics primitives can be combined with procedural noise functions to create expressive but sparsely defined vector graphic images. We also look at how the gradient mesh can be extended to arbitrary topology variants. Here, we compare existing work with two new formulations of a polygonal gradient mesh. Finally we show how we can turn any image into a vector graphics image in an efficient manner. This vectorisation process automatically extracts important image features and constructs a mesh around it. This automatic pipeline is very efficient and even facilitates interactive image vectorisation

Quad Dominant 2-Manifold Mesh Modeling

In this dissertation, I present a modeling framework that provides modeling of 2D smooth meshes in arbitrary topology without any need for subdivision. In the framework, each edge of a quad face is represented by a smooth spline curve, which can be manipulated using edge vertices and additional tangential points. The overall smoothness is achieved by interpolating all four edges of any given quad across the quad surface. The framework consists of simple quad preserving operations that manipulate the principal curves of the smooth model. These operations are all variants of a generic “Curve Split" and its inverse, “Region Collapse". By only using these sets of simple operations, it is possibly to model any desired shape conveniently. I also provide implementation guidelines for these operations. In the results of this dissertation, I present three main applications for this modeling framework. The major application is modeling Mock3D shapes; shapes with well defined interior normals by interpolating the normals at the boundaries of the shape across its surface which can serve as a mock 3D model to mimic a 3D CGI look. As a second application, the framework can be used in origami modeling by allowing assignment of crease patterns across the surface of 2D shapes modelled. Finally, vectorization of reference photos via modeling figures by following their contours is presented as a third application

Freeform User Interfaces for Graphical Computing

報告番号: 甲15222 ; 学位授与年月日: 2000-03-29 ; 学位の種別: 課程博士 ; 学位の種類: 博士(工学) ; 学位記番号: 博工第4717号 ; 研究科・専攻: 工学系研究科情報工学専

Artistic Content Representation and Modelling based on Visual Style Features

This thesis aims to understand visual style in the context of computer science, using traditionally intangible artistic properties to enhance existing content manipulation algorithms and develop new content creation methods. The developed algorithms can be used to apply extracted properties to other drawings automatically; transfer a selected style; categorise images based upon perceived style; build 3D models using style features from concept artwork; and other style-based actions that change our perception of an object without changing our ability to recognise it. The research in this thesis aims to provide the style manipulation abilities that are missing from modern digital art creation pipelines

3D object reconstruction using computer vision : reconstruction and characterization applications for external human anatomical structures

Tese de doutoramento. Engenharia Informática. Faculdade de Engenharia. Universidade do Porto. 201

Mathematical and Data-driven Pattern Representation with Applications in Image Processing, Computer Graphics, and Infinite Dimensional Dynamical Data Mining

Patterns represent the spatial or temporal regularities intrinsic to various phenomena in nature, society, art, and science. From rigid ones with well-defined generative rules to flexible ones implied by unstructured data, patterns can be assigned to a spectrum. On one extreme, patterns are completely described by algebraic systems where each individual pattern is obtained by repeatedly applying simple operations on primitive elements. On the other extreme, patterns are perceived as visual or frequency regularities without any prior knowledge of the underlying mechanisms. In this thesis, we aim at demonstrating some mathematical techniques for representing patterns traversing the aforementioned spectrum, which leads to qualitative analysis of the patterns' properties and quantitative prediction of the modeled behaviors from various perspectives. We investigate lattice patterns from material science, shape patterns from computer graphics, submanifold patterns encountered in point cloud processing, color perception patterns applied in underwater image processing, dynamic patterns from spatial-temporal data, and low-rank patterns exploited in medical image reconstruction. For different patterns and based on their dependence on structured or unstructured data, we present suitable mathematical representations using techniques ranging from group theory to deep neural networks.Ph.D

Tangent-ball techniques for shape processing

Shape processing defines a set of theoretical and algorithmic tools for creating, measuring and modifying digital representations of shapes.  Such tools are of paramount importance to many disciplines of computer graphics, including modeling, animation, visualization, and image processing.  Many applications of shape processing can be found in the entertainment and medical industries. In an attempt to improve upon many previous shape processing techniques, the present thesis explores the theoretical and algorithmic aspects of a difference measure, which involves fitting a ball (disk in 2D and sphere in 3D) so that it has at least one tangential contact with each shape and the ball interior is disjoint from both shapes. We propose a set of ball-based operators and discuss their properties, implementations, and applications.  We divide the group of ball-based operations into unary and binary as follows: Unary operators include: * Identifying details (sharp, salient features, constrictions) * Smoothing shapes by removing such details, replacing them by fillets and roundings * Segmentation (recognition, abstract modelization via centerline and radius variation) of tubular structures Binary operators include: * Measuring the local discrepancy between two shapes * Computing the average of two shapes * Computing point-to-point correspondence between two shapes * Computing circular trajectories between corresponding points that meet both shapes at right angles * Using these trajectories to support smooth morphing (inbetweening) * Using a curve morph to construct surfaces that interpolate between contours on consecutive slices The technical contributions of this thesis focus on the implementation of these tangent-ball operators and their usefulness in applications of shape processing. We show specific applications in the areas of animation and computer-aided medical diagnosis.  These algorithms are simple to implement, mathematically elegant, and fast to execute.Ph.D.Committee Chair: Jarek Rossignac; Committee Member: Greg Slabaugh; Committee Member: Greg Turk; Committee Member: Karen Liu; Committee Member: Maryann Simmon