Computing Distance Functions from Generalized Sources on Weighted Polyhedral Surfaces

We present algorithms for computing approximate distance functions and shortest paths from a generalized source (point, segment, polygonal chain or polygonal region) on a weighted non-convex polyhedral surface in which obstacles (represented by polygonal chains or polygons) are allowed. We also describe an algorithm for discretizing, by using graphics hardware capabilities, distance functions. Finally, we present algorithms for computing discrete k-order Voronoi diagrams

New computer software for defining the three-dimensional geometry for a centrifu- gal compressor impeller

In this thesis, a computer software for defining the geometry for a centrifugal compressor impeller is designed and implemented. The project is done under the supervision of Laboratory of Fluid Dynamics in Lappeenranta University of Technology. This thesis is similar to the thesis written by Tomi Putus (2009) in which a centrifugal compressor impeller flow channel is researched and commonly used design practices are reviewed. Putus wrote a computer software which can be used to define impeller’s three-dimensional geometry based on the basic geometrical dimensions given by a preliminary design. The software designed in this thesis is almost similar but it uses a different programming language (C++) and a different way to define the shape of the impeller meridional projection.

Learning and Exploiting Camera Geometry for Computer Vision

This work explores the use of statistical methods in describing and estimating camera poses, as well as the information feedback loop between camera pose and object detection. Surging development in robotics and computer vision has pushed the need for algorithms that infer, understand, and utilize information about the position and orientation of the sensor platforms when observing and/or interacting with their environment.

The first contribution of this thesis is the development of a set of statistical tools for representing and estimating the uncertainty in object poses. A distribution for representing the joint uncertainty over multiple object positions and orientations is described, called the mirrored normal-Bingham distribution. This distribution generalizes both the normal distribution in Euclidean space, and the Bingham distribution on the unit hypersphere. It is shown to inherit many of the convenient properties of these special cases: it is the maximum-entropy distribution with fixed second moment, and there is a generalized Laplace approximation whose result is the mirrored normal-Bingham distribution. This distribution and approximation method are demonstrated by deriving the analytical approximation to the wrapped-normal distribution. Further, it is shown how these tools can be used to represent the uncertainty in the result of a bundle adjustment problem.

Another application of these methods is illustrated as part of a novel camera pose estimation algorithm based on object detections. The autocalibration task is formulated as a bundle adjustment problem using prior distributions over the 3D points to enforce the objects' structure and their relationship with the scene geometry. This framework is very flexible and enables the use of off-the-shelf computational tools to solve specialized autocalibration problems. Its performance is evaluated using a pedestrian detector to provide head and foot location observations, and it proves much faster and potentially more accurate than existing methods.

Finally, the information feedback loop between object detection and camera pose estimation is closed by utilizing camera pose information to improve object detection in scenarios with significant perspective warping. Methods are presented that allow the inverse perspective mapping traditionally applied to images to be applied instead to features computed from those images. For the special case of HOG-like features, which are used by many modern object detection systems, these methods are shown to provide substantial performance benefits over unadapted detectors while achieving real-time frame rates, orders of magnitude faster than comparable image warping methods.

The statistical tools and algorithms presented here are especially promising for mobile cameras, providing the ability to autocalibrate and adapt to the camera pose in real time. In addition, these methods have wide-ranging potential applications in diverse areas of computer vision, robotics, and imaging.

Numerical modelling of single-layer folding: clarification of an issue regarding the possible effect of computer codes and the influence of initial irregularities

The influence of initial perturbation geometry and material propel-ties on final fold geometry has been investigated using finite-difference (FLAC) and finite-element (MARC) numerical models. Previous studies using these two different codes reported very different folding behaviour although the material properties, boundary conditions and initial perturbation geometries were similar. The current results establish that the discrepancy was not due to the different computer codes but due to the different strain rates employed in the two previous studies (i.e. 10(-6) s(-1) in the FLAC models and 10(-14) s(-1) in the MARC models). As a result, different parts of the elasto-viscous rheological field were bring investigated. For the same material properties, strain rate and boundary conditions, the present results using the two different codes are consistent. A transition in Folding behaviour, from a situation where the geometry of initial perturbation determines final fold shape to a situation where material properties control the final geometry, is produced using both models. This transition takes place with increasing strain rate, decreasing elastic moduli or increasing viscosity (reflecting in each case the increasing influence of the elastic component in the Maxwell elastoviscous rheology). The transition described here is mechanically feasible but is associated with very high stresses in the competent layer (on the order of GPa), which is improbable under natural conditions. (C) 2000 Elsevier Science Ltd. All rights reserved.

Gender differences in bone geometry during the adolescent growth spurt

To investigate whether there are gender differences in the bone geometry of the proximal femur during the adolescent years we used an interactive computer program ?Hip Strength Analysis? developed by Beck and associates (Beck et al., Invest Radiol. 1990,25:6-18.) to derive femoral neck geometry parameters from DXA bone scans (Hologic 2000, array mode). We analyzed a longitudinal data-set collected on 70 boys and 68 girls over a seven year period. Distance and velocity curves for height were fitted for each child utilizing a cubic spline procedure and the age of peak height velocity (PHV) was determined. To control for maturational differences between children of the same chronological age and between boys and girls, section modulus (Z) an index of bending strength, cross sectional area of bone (CSA), sub-periosteal width (SPW), and BMD values at the neck and shaft of the proximal femur were determined for points on each individual?s curve at the age of PHV and one and two years on either side of peak. To control for size differences, height and weight were introduced as co-variates in the two-way analyses of variance looking at gender over time measured at the maturational age points (-2, -1, age of PHV, +1, +2). The following figure presents the results of the analyses on two variables, BMD and Z at neck and shaft regions:After the age of peak linear growth (PHV), independent of body size, there was a gender difference in BMD at the shaft but not at the neck. Section modulus at both sites indicated that male bones became significantly stronger after PHV. Underlying these maturational changes, male bones became wider (SPW) after PHV in both the neck and shaft and enclosed more material (CSA) at all maturational age points at both regions. These results call into question the emphasis on using BMD as a measure of skeletal integrity in growing children

Unknown Radial Distortion Centers in Multiple View Geometry Problems

The radial undistortion model proposed by Fitzgibbon and the radial fundamental matrix were early steps to extend classical epipolar geometry to distorted cameras. Later minimal solvers have been proposed to find relative pose and radial distortion, given point correspondences between images. However, a big drawback of all these approaches is that they require the distortion center to be exactly known. In this paper we show how the distortion center can be absorbed into a new radial fundamental matrix. This new formulation is much more practical in reality as it allows also digital zoom, cropped images and camera-lens systems where the distortion center does not exactly coincide with the image center. In particular we start from the setting where only one of the two images contains radial distortion, analyze the structure of the particular radial fundamental matrix and show that the technique also generalizes to other linear multi-view relationships like trifocal tensor and homography. For the new radial fundamental matrix we propose different estimation algorithms from 9,10 and 11 points. We show how to extract the epipoles and prove the practical applicability on several epipolar geometry image pairs with strong distortion that - to the best of our knowledge - no other existing algorithm can handle properly.

Mobile image processing to support educational geometry games

The mobile IT era is here, it is still growing and expanding at a steady rate and, most of all, it is entertaining. Mobile devices are used for entertainment, whether social through the so-called social networks, or private through web browsing, video watching or gaming. Youngsters make heavy use of these devices, and even small children show impressive adaptability and skill. However not much attention is directed towards education, especially in the case of young children. Too much time is usually spent in games which only purpose is to keep children entertained, time that could be put to better use such as developing elementary geometric notions. Taking advantage of this pocket computer scenario, it is proposed an application geared towards small children in the 6 – 9 age group that allows them to consolidate knowledge regarding geometric shapes, forming a stepping stone that leads to some fundamental mathematical knowledge to be exercised later on. To achieve this goal, the application will detect simple geometric shapes like squares, circles and triangles using the device’s camera. The novelty of this application will be a core real-time detection system designed and developed from the ground up for mobile devices, taking into account their characteristic limitations such as reduced processing power, memory and battery. User feedback was be gathered, aggregated and studied to assess the educational factor of the application.

Geometry and physics of knots

KNOTS are usually categorized in terms of topological properties that are invariant under changes in a knot's spatial configuration(1-4). Here we approach knot identification from a different angle, by considering the properties of particular geometrical forms which we define as 'ideal'. For a knot with a given topology and assembled from a tube of uniform diameter, the ideal form is the geometrical configuration having the highest ratio of volume to surface area. Practically, this is equivalent to determining the shortest piece of tube that can be closed to form the knot. Because the notion of an ideal form is independent of absolute spatial scale, the length-to-diameter ratio of a tube providing an ideal representation is constant, irrespective of the tube's actual dimensions. We report the results of computer simulations which show that these ideal representations of knots have surprisingly simple geometrical properties. In particular, there is a simple linear relationship between the length-to-diameter ratio and the crossing number-the number of intersections in a two-dimensional projection of the knot averaged over all directions. We have also found that the average shape of knotted polymeric chains in thermal equilibrium is closely related to the ideal representation of the corresponding knot type. Our observations provide a link between ideal geometrical objects and the behaviour of seemingly disordered systems, and allow the prediction of properties of knotted polymers such as their electrophoretic mobility(5).

VVER-440 Thermal Hydraulics as a Computer Code Validation Challenge

This thesis concentrates on the validation of a generic thermal hydraulic computer code TRACE under the challenges of the VVER-440 reactor type. The code capability to model the VVER-440 geometry and thermal hydraulic phenomena specific to this reactor design has been examined and demonstrated acceptable. The main challenge in VVER-440 thermal hydraulics appeared in the modelling of the horizontal steam generator. The major challenge here is not in the code physics or numerics but in the formulation of a representative nodalization structure. Another VVER-440 specialty, the hot leg loop seals, challenges the system codes functionally in general, but proved readily representable. Computer code models have to be validated against experiments to achieve confidence in code models. When new computer code is to be used for nuclear power plant safety analysis, it must first be validated against a large variety of different experiments. The validation process has to cover both the code itself and the code input. Uncertainties of different nature are identified in the different phases of the validation procedure and can even be quantified. This thesis presents a novel approach to the input model validation and uncertainty evaluation in the different stages of the computer code validation procedure. This thesis also demonstrates that in the safety analysis, there are inevitably significant uncertainties that are not statistically quantifiable; they need to be and can be addressed by other, less simplistic means, ultimately relying on the competence of the analysts and the capability of the community to support the experimental verification of analytical assumptions. This method completes essentially the commonly used uncertainty assessment methods, which are usually conducted using only statistical methods.

Automatic Structure Generation using Genetic Programming and Fractal Geometry

Three dimensional model design is a well-known and studied field, with numerous real-world applications. However, the manual construction of these models can often be time-consuming to the average user, despite the advantages o ffered through computational advances. This thesis presents an approach to the design of 3D structures using evolutionary computation and L-systems, which involves the automated production of such designs using a strict set of fitness functions. These functions focus on the geometric properties of the models produced, as well as their quantifiable aesthetic value - a topic which has not been widely investigated with respect to 3D models. New extensions to existing aesthetic measures are discussed and implemented in the presented system in order to produce designs which are visually pleasing. The system itself facilitates the construction of models requiring minimal user initialization and no user-based feedback throughout the evolutionary cycle. The genetic programming evolved models are shown to satisfy multiple criteria, conveying a relationship between their assigned aesthetic value and their perceived aesthetic value. Exploration into the applicability and e ffectiveness of a multi-objective approach to the problem is also presented, with a focus on both performance and visual results. Although subjective, these results o er insight into future applications and study in the fi eld of computational aesthetics and automated structure design.

An algorithm for automatic checking of exercises in a dynamic geometry system: iGeom

One of the key issues in e-learning environments is the possibility of creating and evaluating exercises. However, the lack of tools supporting the authoring and automatic checking of exercises for specifics topics (e.g., geometry) drastically reduces advantages in the use of e-learning environments on a larger scale, as usually happens in Brazil. This paper describes an algorithm, and a tool based on it, designed for the authoring and automatic checking of geometry exercises. The algorithm dynamically compares the distances between the geometric objects of the student`s solution and the template`s solution, provided by the author of the exercise. Each solution is a geometric construction which is considered a function receiving geometric objects (input) and returning other geometric objects (output). Thus, for a given problem, if we know one function (construction) that solves the problem, we can compare it to any other function to check whether they are equivalent or not. Two functions are equivalent if, and only if, they have the same output when the same input is applied. If the student`s solution is equivalent to the template`s solution, then we consider the student`s solution as a correct solution. Our software utility provides both authoring and checking tools to work directly on the Internet, together with learning management systems. These tools are implemented using the dynamic geometry software, iGeom, which has been used in a geometry course since 2004 and has a successful track record in the classroom. Empowered with these new features, iGeom simplifies teachers` tasks, solves non-trivial problems in student solutions and helps to increase student motivation by providing feedback in real time. (c) 2008 Elsevier Ltd. All rights reserved.

Investigation of Plasma Immersion Ion Implantation Process in Magnetic Mirror Geometry

Plasma immersion ion implantation (PIII) with low external magnetic field has been investigated both numerically and experimentally. The static magnetic field considered is essentially nonuniform and is generated by two magnetic coils installed outside the vacuum chamber. Experiments have been conducted to investigate the effect of two of the most important PIII parameters: target voltage and gas pressure. In that context, it was found that the current density increased when the external parameters were varied. Later, the PIII process was analyzed numerically using the 2.5-D computer code KARAT. The numerical results show that the system of crossed E x B fields enhances the PIII process. The simulation showed an increase of the plasma density around the target under the operating and design conditions considered. Consequently, an increase of the ion current density on the target was observed. All these results are explained through the mechanism of gas ionization by collisions with electrons drifting in crossed E x B fields.

Differential geometry of intersection curves in R(4) of three implicit surfaces

We present algorithms for computing the differential geometry properties of intersection Curves of three implicit surfaces in R(4), using the implicit function theorem and generalizing the method of X. Ye and T. Maekawa for 4-dimension. We derive t, n, b(1), b(2) vectors and curvatures (k(1), k(2), k(3)) for transversal intersections of the intersection problem. (C) 2008 Elsevier B.V. All rights reserved.

Computer-aided design of a novel ligand for retinoic acid receptor in cancer chemotherapy

The isotypes of RAR and RXR are retinoic acid and retinoid X acid receptors, respectively, whose ligand-binding domain contains the ligand-dependent activation function, with distinct pharmacological targets for retinoids, involved in the treatment of various cancers and skin diseases. Due to the major challenge which cancer treatment and cure still imposes after many decades to the international scientific community, there is actually considerable interest in new ligands with increased bioactivity. We have focused on the retinoid acid receptor, which is considered an interesting target for drug design. In this work, we carried out density functional geometry optimizations, and different docking procedures. We performed screening in a large database (hundreds of thousands of molecules which we optimized at the AM1 level) yielding a set of potential bioactive ligands. A new ligand was selected and optimized at the B3LYP/6-31G* level. A flexible docking program was used to investigate the interactions between the receptor and the new ligand. The result of this work is compared with several crystallographic ligands of RAR. Our theoretically more bioactive new-ligand indicates stronger and more hydrogen bonds as well as hydrophobic interactions with the receptor. (c) 2005 Wiley Periodicals, Inc.