# A new look at Euclid's second proposition

## Related Articles

- On the geometry of O'N. Leemans, Dimitri // Journal of Geometry;2010, Vol. 97 Issue 1/2, p83
We classify the rank two BCDL-geometries of O'Nan and show that the maximal rank of a BCDL-geometry for O'Nan is 4. This bound is sharp since it is satisfied by the rank four geometry given by Buekenhout (Contemp Math 45:1-32, 1985).

- TWO ALGORITHMIC RESULTS FOR THE TRAVELING SALESMAN PROBLEM. Barvinok, Alexander I. // Mathematics of Operations Research;Feb96, Vol. 21 Issue 1, p65
For any norm in a Euclidean space and for any number d > 0 we present a polynomial time algorithm which computes a Hamiltonian circuit with the given vertices in the space whose length approximates, with relative error less than d, the largest length of a Hamiltonian circuit with these vertices....

- 7th International Conference on Geometry and Applications. // Journal of Geometry;2006, Vol. 84 Issue 1/2, p186
The article reports developments during the 7th International Conference on Geometry and Applications in September 4-10,2005 in Varna, Bulgaria. There are many techniques, focused reducing the dimensionality of data, including Multidimensional Scaling, which are based on the representation of...

- The Concept of Existence and the Role of Constructions in Euclid's Elements. HARARI, ORNA // Archive for History of Exact Sciences;Jan2003, Vol. 57 Issue 1, p1
This paper examines the widely accepted contention that geometrical constructions serve in Greek mathematics as proofs of the existence of the constructed figures. In particular, I consider the following two questions: first, whether the evidence taken from Aristotle's philosophy does support...

- An improved column generation algorithm for minimum sum-of-squares clustering. Aloise, Daniel; Hansen, Pierre; Liberti, Leo // Mathematical Programming;Feb2012, Vol. 131 Issue 1/2, p195
Given a set of entities associated with points in Euclidean space, minimum sum-of-squares clustering (MSSC) consists in partitioning this set into clusters such that the sum of squared distances from each point to the centroid of its cluster is minimized. A column generation algorithm for MSSC...

- Some thoughts about geometries. Fielker, David // Mathematics in School;Mar2011, Vol. 40 Issue 2, p23
The article discusses geometry and invariance. The author talks about the early days of Cabri, Euclidean geometry, topology, coordinate geometry, vector geometry, and transformation geometry. According to the author, current technology provides a variety of techniques for the exploration of...

- ON RIEMANN INTEGRAL QUASICONTINUITY. Grande, Zbigniew // Real Analysis Exchange;2005/2006, Vol. 31 Issue 1, p239
A function f : â„n â†’ â„ satisfies condition (Qr,i (x)) (resp. (Qr,s (x)), [Qr,o (x)]) at a point x if for each real r â‰¥ 0 and for each set U containing x and belonging to Euclidean topology in â„n (resp. to the strong density topology [to the ordinary density...

- An algorithm to generate random dense arrangements for discrete element simulations of granular assemblies. Bagi, Katalin // Granular Matter;Apr2005, Vol. 7 Issue 1, p31
A discrete element simulation of a mechanical problem involving granular materials begins with the definition of the geometry of the sample to be analyzed. Since the dynamic sample preparation methods typically used in the practice are very time-consuming, constructive algorithms are becoming...

- Modeling wave propagation in realistic heart geometries using the phase-field method. Fenton, Flavio H.; Cherry, Elizabeth M.; Karma, Alain; Rappel, Wouter-Jan // Chaos;Mar2005, Vol. 15 Issue 1, p013502
We present a novel algorithm for modeling electrical wave propagation in anatomical models of the heart. The algorithm uses a phase-field approach that represents the boundaries between the heart muscle and the surrounding medium as a spatially diffuse interface of finite thickness. The chief...