An Improvised Algorithm to Identify The Beauty of A Planar Curve
R.U. Gobithaasan, Jamaludin Md. Ali, Kenjiro T. Miura
TL;DR
This paper introduces an improved algorithm that generates the LDGC graph to assess the aesthetic quality of monotonic planar curves more efficiently than previous methods.
Contribution
It presents a novel, simplified algorithm for creating the LDGC graph, enhancing the process of evaluating curve beauty compared to prior approaches.
Findings
LDGC effectively identifies aesthetic qualities of curves
The new algorithm reduces computational effort
LDGC outperforms previous methods in efficiency
Abstract
An improvised algorithm is proposed based on the work of Yoshimoto and Harada. The improvised algorithm results a graph which is called LDGC or Logarithmic Distribution Graph of Curvature. This graph has the capability to identify the beauty of monotonic planar curves with less effort as compared to LDDC by Yoshimoto and Harada.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Numerical Analysis Techniques · Computer Graphics and Visualization Techniques · Advanced Vision and Imaging