PROJECTIVE GEOMETRY B3 Course 2003 Nigel Hitchin
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Kernelization of the Subset General Position Problem in Geometry Jean-Daniel Boissonnat, Kunal Dutta, Arijit Ghosh, Sudeshna Kolay
Kernelization of the Subset General Position problem in Geometry Jean-Daniel Boissonnat, Kunal Dutta, Arijit Ghosh, Sudeshna Kolay To cite this version: Jean-Daniel Boissonnat, Kunal Dutta, Arijit Ghosh, Sudeshna Kolay. Kernelization of the Subset General Position problem in Geometry. MFCS 2017 - 42nd International Symposium on Mathematical Foundations of Computer Science, Aug 2017, Alborg, Denmark. 10.4230/LIPIcs.MFCS.2017.25. hal-01583101 HAL Id: hal-01583101 https://hal.inria.fr/hal-01583101 Submitted on 6 Sep 2017 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Kernelization of the Subset General Position problem in Geometry Jean-Daniel Boissonnat1, Kunal Dutta1, Arijit Ghosh2, and Sudeshna Kolay3 1 INRIA Sophia Antipolis - Méditerranée, France 2 Indian Statistical Institute, Kolkata, India 3 Eindhoven University of Technology, Netherlands. Abstract In this paper, we consider variants of the Geometric Subset General Position problem. In defining this problem, a geometric subsystem is specified, like a subsystem of lines, hyperplanes or spheres. The input of the problem is a set of n points in Rd and a positive integer k. The objective is to find a subset of at least k input points such that this subset is in general position with respect to the specified subsystem. -
Homology Stratifications and Intersection Homology 1 Introduction
ISSN 1464-8997 (on line) 1464-8989 (printed) 455 Geometry & Topology Monographs Volume 2: Proceedings of the Kirbyfest Pages 455–472 Homology stratifications and intersection homology Colin Rourke Brian Sanderson Abstract A homology stratification is a filtered space with local ho- mology groups constant on strata. Despite being used by Goresky and MacPherson [3] in their proof of topological invariance of intersection ho- mology, homology stratifications do not appear to have been studied in any detail and their properties remain obscure. Here we use them to present a simplified version of the Goresky–MacPherson proof valid for PL spaces, and we ask a number of questions. The proof uses a new technique, homology general position, which sheds light on the (open) problem of defining generalised intersection homology. AMS Classification 55N33, 57Q25, 57Q65; 18G35, 18G60, 54E20, 55N10, 57N80, 57P05 Keywords Permutation homology, intersection homology, homology stratification, homology general position Rob Kirby has been a great source of encouragement. His help in founding the new electronic journal Geometry & Topology has been invaluable. It is a great pleasure to dedicate this paper to him. 1 Introduction Homology stratifications are filtered spaces with local homology groups constant on strata; they include stratified sets as special cases. Despite being used by Goresky and MacPherson [3] in their proof of topological invariance of intersec- tion homology, they do not appear to have been studied in any detail and their properties remain obscure. It is the purpose of this paper is to publicise these neglected but powerful tools. The main result is that the intersection homology groups of a PL homology stratification are given by singular cycles meeting the strata with appropriate dimension restrictions. -
Projective Geometry: a Short Introduction
Projective Geometry: A Short Introduction Lecture Notes Edmond Boyer Master MOSIG Introduction to Projective Geometry Contents 1 Introduction 2 1.1 Objective . .2 1.2 Historical Background . .3 1.3 Bibliography . .4 2 Projective Spaces 5 2.1 Definitions . .5 2.2 Properties . .8 2.3 The hyperplane at infinity . 12 3 The projective line 13 3.1 Introduction . 13 3.2 Projective transformation of P1 ................... 14 3.3 The cross-ratio . 14 4 The projective plane 17 4.1 Points and lines . 17 4.2 Line at infinity . 18 4.3 Homographies . 19 4.4 Conics . 20 4.5 Affine transformations . 22 4.6 Euclidean transformations . 22 4.7 Particular transformations . 24 4.8 Transformation hierarchy . 25 Grenoble Universities 1 Master MOSIG Introduction to Projective Geometry Chapter 1 Introduction 1.1 Objective The objective of this course is to give basic notions and intuitions on projective geometry. The interest of projective geometry arises in several visual comput- ing domains, in particular computer vision modelling and computer graphics. It provides a mathematical formalism to describe the geometry of cameras and the associated transformations, hence enabling the design of computational ap- proaches that manipulates 2D projections of 3D objects. In that respect, a fundamental aspect is the fact that objects at infinity can be represented and manipulated with projective geometry and this in contrast to the Euclidean geometry. This allows perspective deformations to be represented as projective transformations. Figure 1.1: Example of perspective deformation or 2D projective transforma- tion. Another argument is that Euclidean geometry is sometimes difficult to use in algorithms, with particular cases arising from non-generic situations (e.g. -
Robot Vision: Projective Geometry
Robot Vision: Projective Geometry Ass.Prof. Friedrich Fraundorfer SS 2018 1 Learning goals . Understand homogeneous coordinates . Understand points, line, plane parameters and interpret them geometrically . Understand point, line, plane interactions geometrically . Analytical calculations with lines, points and planes . Understand the difference between Euclidean and projective space . Understand the properties of parallel lines and planes in projective space . Understand the concept of the line and plane at infinity 2 Outline . 1D projective geometry . 2D projective geometry ▫ Homogeneous coordinates ▫ Points, Lines ▫ Duality . 3D projective geometry ▫ Points, Lines, Planes ▫ Duality ▫ Plane at infinity 3 Literature . Multiple View Geometry in Computer Vision. Richard Hartley and Andrew Zisserman. Cambridge University Press, March 2004. Mundy, J.L. and Zisserman, A., Geometric Invariance in Computer Vision, Appendix: Projective Geometry for Machine Vision, MIT Press, Cambridge, MA, 1992 . Available online: www.cs.cmu.edu/~ph/869/papers/zisser-mundy.pdf 4 Motivation – Image formation [Source: Charles Gunn] 5 Motivation – Parallel lines [Source: Flickr] 6 Motivation – Epipolar constraint X world point epipolar plane x x’ x‘TEx=0 C T C’ R 7 Euclidean geometry vs. projective geometry Definitions: . Geometry is the teaching of points, lines, planes and their relationships and properties (angles) . Geometries are defined based on invariances (what is changing if you transform a configuration of points, lines etc.) . Geometric transformations -
Algebraic Geometry Michael Stoll
Introductory Geometry Course No. 100 351 Fall 2005 Second Part: Algebraic Geometry Michael Stoll Contents 1. What Is Algebraic Geometry? 2 2. Affine Spaces and Algebraic Sets 3 3. Projective Spaces and Algebraic Sets 6 4. Projective Closure and Affine Patches 9 5. Morphisms and Rational Maps 11 6. Curves — Local Properties 14 7. B´ezout’sTheorem 18 2 1. What Is Algebraic Geometry? Linear Algebra can be seen (in parts at least) as the study of systems of linear equations. In geometric terms, this can be interpreted as the study of linear (or affine) subspaces of Cn (say). Algebraic Geometry generalizes this in a natural way be looking at systems of polynomial equations. Their geometric realizations (their solution sets in Cn, say) are called algebraic varieties. Many questions one can study in various parts of mathematics lead in a natural way to (systems of) polynomial equations, to which the methods of Algebraic Geometry can be applied. Algebraic Geometry provides a translation between algebra (solutions of equations) and geometry (points on algebraic varieties). The methods are mostly algebraic, but the geometry provides the intuition. Compared to Differential Geometry, in Algebraic Geometry we consider a rather restricted class of “manifolds” — those given by polynomial equations (we can allow “singularities”, however). For example, y = cos x defines a perfectly nice differentiable curve in the plane, but not an algebraic curve. In return, we can get stronger results, for example a criterion for the existence of solutions (in the complex numbers), or statements on the number of solutions (for example when intersecting two curves), or classification results. -
Interpolation
Current Developments in Algebraic Geometry MSRI Publications Volume 59, 2011 Interpolation JOE HARRIS This is an overview of interpolation problems: when, and how, do zero- dimensional schemes in projective space fail to impose independent conditions on hypersurfaces? 1. The interpolation problem 165 2. Reduced schemes 167 3. Fat points 170 4. Recasting the problem 174 References 175 1. The interpolation problem We give an overview of the exciting class of problems in algebraic geometry known as interpolation problems: basically, when points (or more generally zero-dimensional schemes) in projective space may fail to impose independent conditions on polynomials of a given degree, and by how much. We work over an arbitrary field K . Our starting point is this elementary theorem: Theorem 1.1. Given any z1;::: zdC1 2 K and a1;::: adC1 2 K , there is a unique f 2 K TzU of degree at most d such that f .zi / D ai ; i D 1;:::; d C 1: More generally: Theorem 1.2. Given any z1;:::; zk 2 K , natural numbers m1;:::; mk 2 N with P mi D d C 1, and ai; j 2 K; 1 ≤ i ≤ kI 0 ≤ j ≤ mi − 1; there is a unique f 2 K TzU of degree at most d such that . j/ f .zi / D ai; j for all i; j: The problem we’ll address here is simple: What can we say along the same lines for polynomials in several variables? 165 166 JOE HARRIS First, introduce some language/notation. The “starting point” statement Theorem 1.1 says that the evaluation map 0 ! L H .ᏻP1 .d// K pi is surjective; or, equivalently, 1 D h .Ᏽfp1;:::;peg.d// 0 1 for any distinct points p1;:::; pe 2 P whenever e ≤ d C 1. -
Definition Concurrent Lines Are Lines That Intersect in a Single Point. 1. Theorem 128: the Perpendicular Bisectors of the Sides
14.3 Notes Thursday, April 23, 2009 12:49 PM Definition 1. Concurrent lines are lines that intersect in a single point. j k m Theorem 128: The perpendicular bisectors of the sides of a triangle are concurrent at a point that is equidistant from the vertices of the triangle. This point is called the circumcenter of the triangle. D E F Theorem 129: The bisectors of the angles of a triangle are concurrent at a point that is equidistant from the sides of the triangle. This point is called the incenter of the triangle. A B Notes Page 1 C A B C Theorem 130: The lines containing the altitudes of a triangle are concurrent. This point is called the orthocenter of the triangle. A B C Theorem 131: The medians of a triangle are concurrent at a point that is 2/3 of the way from any vertex of the triangle to the midpoint of the opposite side. This point is called the centroid of the of the triangle. Example 1: Construct the incenter of ABC A B C Notes Page 2 14.4 Notes Friday, April 24, 2009 1:10 PM Examples 1-3 on page 670 1. Construct an angle whose measure is equal to 2A - B. A B 2. Construct the tangent to circle P at point A. P A 3. Construct a tangent to circle O from point P. Notes Page 3 3. Construct a tangent to circle O from point P. O P Notes Page 4 14.5 notes Tuesday, April 28, 2009 8:26 AM Constructions 9, 10, 11 Geometric mean Notes Page 5 14.6 Notes Tuesday, April 28, 2009 9:54 AM Construct: ABC, given {a, ha, B} a Ha B A b c B C a Notes Page 6 14.1 Notes Tuesday, April 28, 2009 10:01 AM Definition: A locus is a set consisting of all points, and only the points, that satisfy specific conditions. -
The Projective Geometry of the Spacetime Yielded by Relativistic Positioning Systems and Relativistic Location Systems Jacques Rubin
The projective geometry of the spacetime yielded by relativistic positioning systems and relativistic location systems Jacques Rubin To cite this version: Jacques Rubin. The projective geometry of the spacetime yielded by relativistic positioning systems and relativistic location systems. 2014. hal-00945515 HAL Id: hal-00945515 https://hal.inria.fr/hal-00945515 Submitted on 12 Feb 2014 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. The projective geometry of the spacetime yielded by relativistic positioning systems and relativistic location systems Jacques L. Rubin (email: [email protected]) Université de Nice–Sophia Antipolis, UFR Sciences Institut du Non-Linéaire de Nice, UMR7335 1361 route des Lucioles, F-06560 Valbonne, France (Dated: February 12, 2014) As well accepted now, current positioning systems such as GPS, Galileo, Beidou, etc. are not primary, relativistic systems. Nevertheless, genuine, relativistic and primary positioning systems have been proposed recently by Bahder, Coll et al. and Rovelli to remedy such prior defects. These new designs all have in common an equivariant conformal geometry featuring, as the most basic ingredient, the spacetime geometry. In a first step, we show how this conformal aspect can be the four-dimensional projective part of a larger five-dimensional geometry. -
Geometry: Neutral MATH 3120, Spring 2016 Many Theorems of Geometry Are True Regardless of Which Parallel Postulate Is Used
Geometry: Neutral MATH 3120, Spring 2016 Many theorems of geometry are true regardless of which parallel postulate is used. A neutral geom- etry is one in which no parallel postulate exists, and the theorems of a netural geometry are true for Euclidean and (most) non-Euclidean geomteries. Spherical geometry is a special case of Non-Euclidean geometries where the great circles on the sphere are lines. This leads to spherical trigonometry where triangles have angle measure sums greater than 180◦. While this is a non-Euclidean geometry, spherical geometry develops along a separate path where the axioms and theorems of neutral geometry do not typically apply. The axioms and theorems of netural geometry apply to Euclidean and hyperbolic geometries. The theorems below can be proven using the SMSG axioms 1 through 15. In the SMSG axiom list, Axiom 16 is the Euclidean parallel postulate. A neutral geometry assumes only the first 15 axioms of the SMSG set. Notes on notation: The SMSG axioms refer to the length or measure of line segments and the measure of angles. Thus, we will use the notation AB to describe a line segment and AB to denote its length −−! −! or measure. We refer to the angle formed by AB and AC as \BAC (with vertex A) and denote its measure as m\BAC. 1 Lines and Angles Definitions: Congruence • Segments and Angles. Two segments (or angles) are congruent if and only if their measures are equal. • Polygons. Two polygons are congruent if and only if there exists a one-to-one correspondence between their vertices such that all their corresponding sides (line sgements) and all their corre- sponding angles are congruent. -
The Dual Theorem Concerning Aubert Line
The Dual Theorem concerning Aubert Line Professor Ion Patrascu, National College "Buzeşti Brothers" Craiova - Romania Professor Florentin Smarandache, University of New Mexico, Gallup, USA In this article we introduce the concept of Bobillier transversal of a triangle with respect to a point in its plan; we prove the Aubert Theorem about the collinearity of the orthocenters in the triangles determined by the sides and the diagonals of a complete quadrilateral, and we obtain the Dual Theorem of this Theorem. Theorem 1 (E. Bobillier) Let 퐴퐵퐶 be a triangle and 푀 a point in the plane of the triangle so that the perpendiculars taken in 푀, and 푀퐴, 푀퐵, 푀퐶 respectively, intersect the sides 퐵퐶, 퐶퐴 and 퐴퐵 at 퐴푚, 퐵푚 and 퐶푚. Then the points 퐴푚, 퐵푚 and 퐶푚 are collinear. 퐴푚퐵 Proof We note that = 퐴푚퐶 aria (퐵푀퐴푚) (see Fig. 1). aria (퐶푀퐴푚) 1 Area (퐵푀퐴푚) = ∙ 퐵푀 ∙ 푀퐴푚 ∙ 2 sin(퐵푀퐴푚̂ ). 1 Area (퐶푀퐴푚) = ∙ 퐶푀 ∙ 푀퐴푚 ∙ 2 sin(퐶푀퐴푚̂ ). Since 1 3휋 푚(퐶푀퐴푚̂ ) = − 푚(퐴푀퐶̂ ), 2 it explains that sin(퐶푀퐴푚̂ ) = − cos(퐴푀퐶̂ ); 휋 sin(퐵푀퐴푚̂ ) = sin (퐴푀퐵̂ − ) = − cos(퐴푀퐵̂ ). 2 Therefore: 퐴푚퐵 푀퐵 ∙ cos(퐴푀퐵̂ ) = (1). 퐴푚퐶 푀퐶 ∙ cos(퐴푀퐶̂ ) In the same way, we find that: 퐵푚퐶 푀퐶 cos(퐵푀퐶̂ ) = ∙ (2); 퐵푚퐴 푀퐴 cos(퐴푀퐵̂ ) 퐶푚퐴 푀퐴 cos(퐴푀퐶̂ ) = ∙ (3). 퐶푚퐵 푀퐵 cos(퐵푀퐶̂ ) The relations (1), (2), (3), and the reciprocal Theorem of Menelaus lead to the collinearity of points 퐴푚, 퐵푚, 퐶푚. Note Bobillier's Theorem can be obtained – by converting the duality with respect to a circle – from the theorem relative to the concurrency of the heights of a triangle. -
The Generalization of Miquels Theorem
THE GENERALIZATION OF MIQUEL’S THEOREM ANDERSON R. VARGAS Abstract. This papper aims to present and demonstrate Clifford’s version for a generalization of Miquel’s theorem with the use of Euclidean geometry arguments only. 1. Introduction At the end of his article, Clifford [1] gives some developments that generalize the three circles version of Miquel’s theorem and he does give a synthetic proof to this generalization using arguments of projective geometry. The series of propositions given by Clifford are in the following theorem: Theorem 1.1. (i) Given three straight lines, a circle may be drawn through their intersections. (ii) Given four straight lines, the four circles so determined meet in a point. (iii) Given five straight lines, the five points so found lie on a circle. (iv) Given six straight lines, the six circles so determined meet in a point. That can keep going on indefinitely, that is, if n ≥ 2, 2n straight lines determine 2n circles all meeting in a point, and for 2n +1 straight lines the 2n +1 points so found lie on the same circle. Remark 1.2. Note that in the set of given straight lines, there is neither a pair of parallel straight lines nor a subset with three straight lines that intersect in one point. That is being considered all along the work, without further ado. arXiv:1812.04175v1 [math.HO] 11 Dec 2018 In order to prove this generalization, we are going to use some theorems proposed by Miquel [3] and some basic lemmas about a bunch of circles and their intersections, and we will follow the idea proposed by Lebesgue[2] in a proof by induction. -
Linear Features in Photogrammetry
Linear Features in Photogrammetry by Ayman Habib Andinet Asmamaw Devin Kelley Manja May Report No. 450 Geodetic Science and Surveying Department of Civil and Environmental Engineering and Geodetic Science The Ohio State University Columbus, Ohio 43210-1275 January 2000 Linear Features in Photogrammetry By: Ayman Habib Andinet Asmamaw Devin Kelley Manja May Report No. 450 Geodetic Science and Surveying Department of Civil and Environmental Engineering and Geodetic Science The Ohio State University Columbus, Ohio 43210-1275 January, 2000 ABSTRACT This research addresses the task of including points as well as linear features in photogrammetric applications. Straight lines in object space can be utilized to perform aerial triangulation. Irregular linear features (natural lines) in object space can be utilized to perform single photo resection and automatic relative orientation. When working with primitives, it is important to develop appropriate representations in image and object space. These representations must accommodate for the perspective projection relating the two spaces. There are various options for representing linear features in the above applications. These options have been explored, and an optimal representation has been chosen. An aerial triangulation technique that utilizes points and straight lines for frame and linear array scanners has been implemented. For this task, the MSAT (Multi Sensor Aerial Triangulation) software, developed at the Ohio State University, has been extended to handle straight lines. The MSAT software accommodates for frame and linear array scanners. In this research, natural lines were utilized to perform single photo resection and automatic relative orientation. In single photo resection, the problem is approached with no knowledge of the correspondence of natural lines between image space and object space.