Approximately n-secting an angle

DOI10.1016/J.IPL.2007.02.007MaRDI QIDQ2379935zbMATH OpenOpenAlexFDO

Authors Seok Woo Kim, Seong-Hun Paeng, Hee Je Cho

Publication date 24 March 2010

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2007.02.007

zbMATH Keywords

computational geometryapproximation algorithmsregular \(n\)-gon\(n\)-secting

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Recommendations

• scientific article; zbMATH DE number 3942353
• Approximate Trisection of an Angle with Euclidean Tools
• On \(n\)-sectors of the angles of an arbitrary triangle
• An L2-Angle between plane sectors
• scientific article; zbMATH DE number 1961279
• A novel approximate method for multisecting an angle into \(n\)-equal segments by the straightedge, compass, and constructible lengths
• scientific article; zbMATH DE number 6963583

Cited in

(6)

• Dividing the circle
• Mechanism analysis of a trisector
• scientific article; zbMATH DE number 2167053 (Why is no real title available?)
• A note on partition sum polynomials
• scientific article; zbMATH DE number 6963583 (Why is no real title available?)
• A novel approximate method for multisecting an angle into \(n\)-equal segments by the straightedge, compass, and constructible lengths

This page was built for publication: Approximately \(n\)-secting an angle

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2379935)