1 |
Geometrische Anwendungen der TensorrechnungLoos, Cläre. January 1970 (has links)
Inaug.--Diss.--Bonn, 1968. / Bibliography: p. 58.
|
2 |
Logic and the Mathematical System of Incidence GeometryMechel, Rose E. January 1966 (has links)
No description available.
|
3 |
Generalisations of the fundamental theorem of projective geometryMcCallum, Rupert Gordon, Mathematics & Statistics, Faculty of Science, UNSW January 2009 (has links)
The fundamental theorem of projective geometry states that a mapping from a projective space to itself whose range has a sufficient number of points in general position is a projective transformation possibly combined with a self-homomorphism of the underlying field. We obtain generalisations of this in many directions, dealing with the case where the mapping is only defined on an open subset of the underlying space, or a subset of positive measure, and dealing with many different spaces over many different rings.
|
4 |
The Quadric Reference Surface: Theory and ApplicationsShashua, Amnon, Toelg, Sebastian 01 June 1994 (has links)
The conceptual component of this work is about "reference surfaces'' which are the dual of reference frames often used for shape representation purposes. The theoretical component of this work involves the question of whether one can find a unique (and simple) mapping that aligns two arbitrary perspective views of an opaque textured quadric surface in 3D, given (i) few corresponding points in the two views, or (ii) the outline conic of the surface in one view (only) and few corresponding points in the two views. The practical component of this work is concerned with applying the theoretical results as tools for the task of achieving full correspondence between views of arbitrary objects.
|
5 |
On sets of odd type and caps in Galois geometries of order fourPacker, S. January 1995 (has links)
No description available.
|
6 |
Generalisations of the fundamental theorem of projective geometryMcCallum, Rupert Gordon, Mathematics & Statistics, Faculty of Science, UNSW January 2009 (has links)
The fundamental theorem of projective geometry states that a mapping from a projective space to itself whose range has a sufficient number of points in general position is a projective transformation possibly combined with a self-homomorphism of the underlying field. We obtain generalisations of this in many directions, dealing with the case where the mapping is only defined on an open subset of the underlying space, or a subset of positive measure, and dealing with many different spaces over many different rings.
|
7 |
Colouring Cayley GraphsChu, Lei January 2005 (has links)
We will discuss three ways to bound the chromatic number on a Cayley graph.
1. If the connection set contains information about a smaller graph, then these two graphs are related. Using this information, we will show that Cayley graphs cannot have chromatic number three.
2. We will prove a general statement that all vertex-transitive maximal triangle-free graphs on <i>n</i> vertices with valency greater than <i>n</i>/3 are 3-colourable. Since Cayley graphs are vertex-transitive, the bound of general graphs also applies to Cayley graphs.
3. Since Cayley graphs for abelian groups arise from vector spaces, we can view the connection set as a set of points in a projective geometry. We will give a characterization of all large complete caps, from which we derive that all maximal triangle-free cubelike graphs on 2<sup>n</sup> vertices and valency greater than 2<sup>n</sup>/4 are either bipartite or 4-colourable.
|
8 |
Image Based Rendering Using Algebraic TechniquesEvgeniou, Theodoros 01 November 1996 (has links)
This paper presents an image-based rendering system using algebraic relations between different views of an object. The system uses pictures of an object taken from known positions. Given three such images it can generate "virtual'' ones as the object would look from any position near the ones that the two input images were taken from. The extrapolation from the example images can be up to about 60 degrees of rotation. The system is based on the trilinear constraints that bind any three view so fan object. As a side result, we propose two new methods for camera calibration. We developed and used one of them. We implemented the system and tested it on real images of objects and faces. We also show experimentally that even when only two images taken from unknown positions are given, the system can be used to render the object from other view points as long as we have a good estimate of the internal parameters of the camera used and we are able to find good correspondence between the example images. In addition, we present the relation between these algebraic constraints and a factorization method for shape and motion estimation. As a result we propose a method for motion estimation in the special case of orthographic projection.
|
9 |
Colouring SubspacesChowdhury, Ameerah January 2005 (has links)
This thesis was originally motivated by considering vector space analogues of problems in extremal set theory, but our main results concern colouring a graph that is intimately related to these vector space analogues. The vertices of the <em>q</em>-Kneser graph are the <em>k</em>-dimensional subspaces of a vector space of dimension <em>v</em> over F<sub><em>q</em></sub>, and two <em>k</em>-subspaces are adjacent if they have trivial intersection. The new results in this thesis involve colouring the <em>q</em>-Kneser graph when <em>k</em>=2. There are two cases. When <em>k</em>=2 and <em>v</em>=4, the chromatic number is <em>q</em><sup>2</sup>+<em>q</em>. If <em>k</em>=2 and <em>v</em>>4, the chromatic number is (<em>q</em><sup>(v-1)</sup>-1)/(<em>q</em>-1). In both cases, we characterise the minimal colourings. We develop some theory for colouring the <em>q</em>-Kneser graph in general.
|
10 |
Colouring Cayley GraphsChu, Lei January 2005 (has links)
We will discuss three ways to bound the chromatic number on a Cayley graph.
1. If the connection set contains information about a smaller graph, then these two graphs are related. Using this information, we will show that Cayley graphs cannot have chromatic number three.
2. We will prove a general statement that all vertex-transitive maximal triangle-free graphs on <i>n</i> vertices with valency greater than <i>n</i>/3 are 3-colourable. Since Cayley graphs are vertex-transitive, the bound of general graphs also applies to Cayley graphs.
3. Since Cayley graphs for abelian groups arise from vector spaces, we can view the connection set as a set of points in a projective geometry. We will give a characterization of all large complete caps, from which we derive that all maximal triangle-free cubelike graphs on 2<sup>n</sup> vertices and valency greater than 2<sup>n</sup>/4 are either bipartite or 4-colourable.
|
Page generated in 0.0994 seconds