Depuis quelques années, l’évolution des techniques d’acquisition a entraîné une généralisation de l’utilisation d’objets 3D très dense, représentés par des nuages de points de plusieurs millions de sommets. Au vu de la complexité de ces données, il est souvent nécessaire de les analyser pour en extraire les structures les plus pertinentes, potentiellement définies à plusieurs échelles. Parmi les nombreuses méthodes traditionnellement utilisées pour analyser des signaux numériques, l’analyse dite scale-space est aujourd’hui un standard pour l’étude des courbes et des images. Cependant, son adaptation aux données 3D pose des problèmes d’instabilité et nécessite une information de connectivité, qui n’est pas directement définie dans les cas des nuages de points. Dans cette thèse, nous présentons une suite d’outils mathématiques pour l’analyse des objets 3D, sous le nom de Growing Least Squares (GLS). Nous proposons de représenter la géométrie décrite par un nuage de points via une primitive du second ordre ajustée par une minimisation aux moindres carrés, et cela à pour plusieurs échelles. Cette description est ensuite derivée analytiquement pour extraire de manière continue les structures les plus pertinentes à la fois en espace et en échelle. Nous montrons par plusieurs exemples et comparaisons que cette représentation et les outils associés définissent une solution efficace pour l’analyse des nuages de points à plusieurs échelles. Un défi intéressant est l’analyse d’objets 3D acquis dans le cadre de l’étude du patrimoine culturel. Dans cette thèse, nous nous étudions les données générées par l’acquisition des fragments des statues entourant par le passé le Phare d’Alexandrie, Septième Merveille du Monde. Plus précisément, nous nous intéressons au réassemblage d’objets fracturés en peu de fragments (une dizaine), mais avec de nombreuses parties manquantes ou fortement dégradées par l’action du temps. Nous proposons un formalisme pour la conception de systèmes d’assemblage virtuel semi-automatiques, permettant de combiner à la fois les connaissances des archéologues et la précision des algorithmes d’assemblage. Nous présentons deux systèmes basés sur cette conception, et nous montrons leur efficacité dans des cas concrets. / Over the last decades, the evolution of acquisition techniques yields the generalization of detailed 3D objects, represented as huge point sets composed of millions of vertices. The complexity of the involved data often requires to analyze them for the extraction and characterization of pertinent structures, which are potentially defined at multiple scales. Amongthe wide variety of methods proposed to analyze digital signals, the scale-space analysis istoday a standard for the study of 2D curves and images. However, its adaptation to 3D dataleads to instabilities and requires connectivity information, which is not directly availablewhen dealing with point sets.In this thesis, we present a new multi-scale analysis framework that we call the GrowingLeast Squares (GLS). It consists of a robust local geometric descriptor that can be evaluatedon point sets at multiple scales using an efficient second-order fitting procedure. We proposeto analytically differentiate this descriptor to extract continuously the pertinent structuresin scale-space. We show that this representation and the associated toolbox define an effi-cient way to analyze 3D objects represented as point sets at multiple scales. To this end, we demonstrate its relevance in various application scenarios.A challenging application is the analysis of acquired 3D objects coming from the CulturalHeritage field. In this thesis, we study a real-world dataset composed of the fragments ofthe statues that were surrounding the legendary Alexandria Lighthouse. In particular, wefocus on the problem of fractured object reassembly, consisting of few fragments (up to aboutten), but with missing parts due to erosion or deterioration. We propose a semi-automaticformalism to combine both the archaeologist’s knowledge and the accuracy of geometricmatching algorithms during the reassembly process. We use it to design two systems, andwe show their efficiency in concrete cases.

With the rise of accessible, affordable, and portable scanning technologies, new possibilities of making scanning real world objects available for a wider range of applications have emerged. Together with the advancements made in making point set processing and surface reconstruction effcient and easily implementable, it may be possible to combine these to make a portable scanner that produces 3D representations of real world objects that are usable for game development purposes. This thesis explores to what extent surface reconstructions created from point sets gathered with Google Tango is useful in game development processes. To explore this, a mobile application and a software program have been iteratively developed and evaluated through a user study. The results suggest that the surface reconstruction may be useful in the development of a game engine project as a basis for creating models on top of. / Med ökningen av tillgängliga, prisvärda och bärbara skanningsteknologierhar nya möjligheter att göra skanning av riktiga objekt tillgängligtför ett brett spektrum av applikationer uppstått. Tillsammans medde framsteg som gjorts för att göra punktmolnsbearbetning och ytrekonstruktionereffektiva och lätt implementerbara kan det vara möjligtatt kombinera dessa för att skapa en bärbar skannare som producerar3D-representationer av verkliga objekt som kan användas förspelutvecklingsändamål. Denna avhandling undersöker i vilken utsträckningytrekonstruktioner som skapats från punktmoln som samlatsmed Google Tango är användbara i spelutvecklingsprocesser. Föratt utforska detta har en mobilapplikation och ett program utvecklatsiterativt och utvärderats med hjälp av en användarstudie. Resultatentyder på att ytrekonstruktionerna kan vara användbara vid utvecklingenav ett spelmotorsprojekt, men som grund för att skapa modellerutifrån.

No description available.

I explore five topics in topology using set-theoretic techniques. The first of these is a generalization of 2-point sets called slice sets. I show that, for any small-in-cardinality subset A of the real line, there is a subset of the plane meeting every line in a topological copy of A. Under Martin's Axiom, I show how to improve this result to any totally disconnected A. Secondly, I show that it is consistent with and independent of ZFC to have a topologically rigid subset of the real line that is smaller than the continuum. Thirdly, I define and examine a new cardinal function related to cleavability. Fourthly, I explore the Toronto Problem and prove that any uncountable, Hausdorff, non-discrete Toronto space that is not regular falls into one of two strictly-defined classes. I also prove that for every infinite cardinality there are precisely 3 non-T1 Toronto spaces up to homeomorphism. Lastly, I examine a notion of dimension called the "neight", and prove several theorems that give a lower bound for this cardinal function.

As we all know the classical set theory has a deep-rooted influence in the traditional mathematics. According to the two-valued logic, an element can belong to a set or cannot. In the former case, the element’s membership degree will be assigned to one, whereas in the latter case it takes the zero value. With other words, a feeling of imprecision or fuzziness in the two-valued logic does not exist. With the rapid development of science and technology, more and more scientists have gradually come to realize the vital importance of the multi-valued logic. Thus, in 1965, Professor Lotfi A. Zadeh from Berkeley University put forward the concept of a fuzzy set. In less than 60 years, people became more and more familiar with fuzzy set theory. The theory of fuzzy sets has been turned to be a favor applied to many fields. The study aims to apply some classical and extensional methods of fuzzy set theory in life expectancy and treatment prognoses for cancer patients. The research is based on real-life problems encountered in clinical works by physicians. From the introductory items of the fuzzy set theory to the medical applications, a collection of detailed analysis of fuzzy set theory and its extensions are presented in the thesis. Concretely speaking, the Mamdani fuzzy control systems and the Sugeno controller have been applied to predict the survival length of gastric cancer patients. In order to keep the gastric cancer patients, already examined, away from the unnecessary suffering from surgical operation, the fuzzy c-means clustering analysis has been adopted to investigate the possibilities for operation contra to nonoperation. Furthermore, the approach of point set approximation has been adopted to estimate the operation possibilities against to nonoperation for an arbitrary gastric cancer patient. In addition, in the domain of multi-expert decision-making, the probabilistic model, the model of 2-tuple linguistic representations and the hesitant fuzzy linguistic term sets (HFLTS) have been utilized to select the most consensual treatment scheme(s) for two separate prostate cancer patients. The obtained results have supplied the physicians with reliable and helpful information. Therefore, the research work can be seen as the mathematical complements to the physicians’ queries.

Thèse numérisée par la Division de la gestion de documents et des archives de l'Université de Montréal.

O estudo do comportamento de fluidos é um antigo domínio das ciências da natureza. Ultimamente, fenômenos de engenharia que eram estudados empiricamente passaram a ser estudados com auxílio computacional. A Dinâmica de Fluidos Computacional (DFC) é a área da ciência da computação que estuda métodos computacionais para simulação de escoamento de fluidos, e muitas vezes é a forma mais prática, ou a única, de se observar fenômenos de interesse no escoamento. Este projeto de Mestrado procurou investigar, no âmbito da simulação de um escoamento bifásico, métodos computacionais para representar a interface entre dois fluidos imiscíveis. A separação dos fluidos por meio de uma interface é necessária para assegurar que, propriedades como viscosidade e densidade, específicas de cada fluido, sejam utilizadas corretamente para o cálculo do movimento de seus respectivos fluidos. Desenvolvemos um método lagrangeano sem a utilização de malhas com o objetivo de suprir algumas restrições de trabalhos prévios. Para representar a interface entre os dois fluidos, este método utiliza uma técnica de reconstrução de superfícies baseada em aproximações de superfícies algébricas de alta ordem. Os resultados numéricos reportados neste documento evidenciam o potencial da nossa abordagem / The study of the behaviour of fluids is an ancient field in natural sciences. Recently, engineering phenomena that were empirically studied started to be done with computacional aid. The Computational Fluid Dynamics (CFD) is the area of science that studies computational methods for computer simulation of fluid flow, and often is the most practical way, or the only, to observe phenomena of interest in flow. This Masters degree project sought to investigate, in the context of the simulation of biphasic flows, computational methods to represent the interface between two immiscible fluids. The separation of fluids by the means of an interface is required to ensure that, during the simulation, the physical properties of a fluid, like density and viscosity (specific of each fluid) are properly used in the calculus of the respective fluid motion. We developed a lagrangean method without the use of mesh with the goal of alleviating some of the previous works restrictions. To represent the interface between the two fluids, this method uses a surface reconstruction technique based on approximations of high order algebraic surfaces. The numerical results reported herein show the potential of our approach

Cette thèse traite de l'analyse de nuages de points 3D désorganisé et s'appuie sur deux outils : un algorithme de partitionnement efficace inspiré des C-moyennes floues d'une part, et des outils de filtrage morphologique de représentation à base de triangulation de Delaunay d'autre part. Le cadre applicatif essentiel est la navigation autonome en robotique mobile en environnement inconnu, c'est-à-dire dans modèle. Mais la méthodologie générique développée a été appliquée à d'autres types d'environnements, notamment plus structurés.

Thèse numérisée par la Division de la gestion de documents et des archives de l'Université de Montréal

Proximity problems and point set embeddability problems are fundamental and well-studied in computational geometry and graph drawing. Examples of such problems that are of particular interest to us in this dissertation include: finding the closest pair among a set P of points, finding the k-nearest neighbors to each point p in P, answering reverse k-nearest neighbor queries, computing the Yao graph, the Semi-Yao graph and the Euclidean minimum spanning tree of P, and mapping the vertices of a planar graph to a set P of points without inducing edge crossings. In this dissertation, we consider so-called kinetic version of these problems, that is, the points are allowed to move continuously along known trajectories, which are subject to change. We design a set of data structures and a mechanism to efficiently update the data structures. These updates occur at critical, discrete times. Also, a query may arrive at any time. We want to answer queries quickly without solving problems from scratch, so we maintain solutions continuously. We present new techniques for giving kinetic solutions with better performance for some these problems, and we provide the first kinetic results for others. In particular, we provide: • A simple kinetic data structure (KDS) to maintain all the nearest neighbors and the closest pair. Our deterministic kinetic approach for maintenance of all the nearest neighbors improves the previous randomized kinetic algorithm. • An exact KDS for maintenance of the Euclidean minimum spanning tree, which improves the previous KDS. • The first KDS's for maintenance of the Yao graph and the Semi-Yao graph. • The first KDS to consider maintaining plane graphs on moving points. • The first KDS for maintenance of all the k-nearest neighbors, for any k ≥ 1. • The first KDS to answer the reverse k-nearest neighbor queries, for any k ≥ 1 in any fixed dimension, on a set of moving points. / Graduate