Sökning: "Euclidean lines"

Visar resultat 1 - 5 av 8 avhandlingar innehållade orden Euclidean lines.

1. 1. Géométrie digitale utilisée pour la discretisation et le recouvrement optimal des objets euclidiens

   Författare :Adama Arouna Koné; Christer O. Kiselman; Ouaténi Diallo; Diby Diarra; Gunilla Borgefors; Fana Tangara; Sado Traoré; Uppsala universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Digital geometry; Euclidean lines; planes; Géométrie digitale; droites euclidiens; plans; Mathematics with specialization in Applied Mathematics; Matematik med inriktning mot tillämpad matematik;

   Sammanfattning : A Euclidean line in the plane is discretized and the discretized line is dilated by a rectangle.  The thesis studies the dilations that cover the original line and determine the optimal ones.  Similarly, dilations of discretized Euclidean hyperplanes are studied, and the optimal coverings are described.. LÄS MER

3. 2. Geometry and Critical Configurations of Multiple Views

   Författare :Fredrik Kahl; Matematik LTH; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; algebra; algebraic geometry; field theory; Number Theory; Matematik; Mathematics; reconstruction; image sequence; absolute conic; critical motions; critical surfaces; perspective projection; affine geometry; Euclidean geometry; multiple view geometry; projective geometry; group theory; Talteori; fältteori; algebraisk geometri; gruppteori; Mathematical logic; set theory; combinatories; Matematisk logik; mängdlära; kombinatorik;

   Sammanfattning : This thesis is concerned with one of the core problems in computer vision, namely to reconstruct a real world scene from several images of it. The interplay between the geometry of the scene, the cameras and the images is analyzed. LÄS MER

4. 3. The Euclidean traveling salesman problem with neighborhoods and a connecting fence

   Författare :Håkan Jonsson; Luleå tekniska universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Dependable Communication and Computation Systems; Kommunikations- och beräkningssystem;

   Sammanfattning : An important class of problems in robotics deals with the planning of paths. In this thesis, we study this class of problems from an algorithmic point of view by considering cases where we have complete knowledge of the environment and each solution must ensure that a point-sized robot capable of moving continuously and turning arbitrarily accomplishes the following: (1) visits a given set of objects attached to an impenetrable simple polygon in the plane, and (2) travels along a path of minimum length over all the possible paths that visit the objects without crossing the polygon. LÄS MER

5. 4. Problems in the Classification Theory of Non-Associative Simple Algebras

   Författare :Erik Darpö; Ernst Dieterich; Karl-Heinz Fieseler; William Crawley-Boevey; Uppsala universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Division algebra; flexible algebra; normal form; composition algebra; absolute valued algebra; vector product; rotation.; MATHEMATICS; MATEMATIK;

   Sammanfattning : In spite of its 150 years history, the problem of classifying all finite-dimensional division algebras over a field k is still unsolved whenever k is not algebraically closed. The present thesis concerns some different aspects of this problem, and the related problems of classifying all composition and absolute valued algebras. LÄS MER

7. 5. Gravity Illustrated. Spacetime Edition

   Författare :Rickard Jonsson; Chalmers tekniska högskola; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; embeddings; pedagogical techniques; curved spacetime; optical geometry; gyroscope precession; inertial forces;

   Sammanfattning : This thesis deals with essentially four different topics within general relativity: pedagogical techniques for illustrating curved spacetime, inertial forces, gyroscope precession and optical geometry. Concerning the pedagogical techniques, I investigate two distinctly different methods, the dual and the absolute method. LÄS MER