Hostname: page-component-586b7cd67f-dlnhk Total loading time: 0 Render date: 2024-12-01T00:00:40.495Z Has data issue: false hasContentIssue false
  • English
  • Français

Networks of the Plane in Absolute Geometry

Published online by Cambridge University Press:  15 September 2014

Duncan M. Y. Sommerville
Duncan M. Y. Sommerville
Affiliation:
University of St Andrews
Get access

Abstract

The problem to divide the plane, without overlapping, into a network of regular polygons with the same length of side, has been completely worked out for the three geometries for the case in which the polygons are all of the same kind. The resulting networks are called regular

Type
Proceedings
Information
Proceedings of the Royal Society of Edinburgh , Volume 25 , Issue 1 , 1906 , pp. 392 - 394
Copyright
Copyright © Royal Society of Edinburgh 1906

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

note * page 393 No. 9 is 2 pentagons and 1 decagon, but this is not a developable angle

note † page 393 I have not exhausted all the composite types in this class. There cannot be more than 222.