Kim, Seok Woo; Paeng, Seong-Hun; Cho, Hee Je Approximately \(n\)-secting an angle. (English) Zbl 1184.68564 Inf. Process. Lett. 103, No. 1, 19-23 (2007). Summary: It is a well-known fact that there exists an angle that cannot be trisected with a straightedge and a compass. In general, it is impossible to divide an arbitrary angle into \(n\)-angles equally with only a straightedge and a compass, where \(n\) is a positive integer. We give an efficient algorithm to divide an arbitrary angle into \(n\)-angles almost equally with only a straightedge and a compass. Using this method, we can construct an almost regular \(n\)-gon for arbitrary \(n\). Cited in 1 Document MSC: 68U05 Computer graphics; computational geometry (digital and algorithmic aspects) 68W25 Approximation algorithms Keywords:computational geometry; approximation algorithms; \(n\)-secting; regular \(n\)-gon PDFBibTeX XMLCite \textit{S. W. Kim} et al., Inf. Process. Lett. 103, No. 1, 19--23 (2007; Zbl 1184.68564) Full Text: DOI References: [1] Courant, R.; Robbins, H., What is Mathematics? (1960), Oxford University Press · JFM 67.0001.05 [2] Fraleigh, J. B., A First Course in Abstract Algebra (1989), Addison-Wesley · Zbl 0697.00001 [3] Lang, S., Algebra (1984), Addison-Wesley [4] Rudin, W., Functional Analysis (1991), McGraw-Hill · Zbl 0867.46001 [5] Shiryaev, A. N., Probability, Graduate Texts in Mathematics, vol. 95 (1984), Springer · Zbl 0536.60001 [6] Silverman, H., Complex Variables (1975), Houghton Mifflin · Zbl 0324.30002 [7] Wantzel, P. L., Recherches sur les moyens de reconnaître si un Problème de Géométrie peut se résoudre avec la régle et le compas, J. Math. Pures Appl., 1, 366-372 (1837) This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.