Hostname: page-component-586b7cd67f-dsjbd Total loading time: 0 Render date: 2024-11-26T18:12:13.277Z Has data issue: false hasContentIssue false

INFINITE PATHS WITH NO SMALL ANGLES

Published online by Cambridge University Press:  10 December 2009

Imre Bárány
Affiliation:
Rényi Institute of Mathematics, Hungarian Academy of Sciences, P.O. Box 127, 1364 Budapest, Hungary Department of Mathematics, University College London, Gower Street, London WC1E 6BT, U.K. (email: [email protected])
Attila Pór
Affiliation:
Department of Mathematics, Western Kentucky University, Bowling Green, KY 42101, U.S.A. (email: [email protected])
Get access

Abstract

It is shown here that given a discrete (and infinite) set of points in the plane, it is possible to arrange them on a polygonal path so that every angle on the polygonal path is at least 9. This has been known to hold for finite sets (with 20). The main result holds for discrete sets in higher dimensions as well, with a smaller bound on the angle.

Type
Research Article
Copyright
Copyright © University College London 2010

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

[1]Bárány, I., Pór, A. and Valtr, P., Paths without small angles. SIAM J. Discrete Math. (2009), to appear.Google Scholar
[2]Dumitrescu, A., 2005, personal communication.Google Scholar
[3]Fekete, S., Geometry and the traveling salesman problem, PhD Thesis, Department of Combinatorics and Optimization, The University of Waterloo, 1992.Google Scholar
[4]Fekete, S. and Woeginger, G. J., Angle-restricted tours in the plane. Comput. Geom. 8 (1997), 195218.Google Scholar
[5]Kynčl, J., 2009, personal communication.Google Scholar