An Improvised Algorithm to Identify The Beauty of A Planar Curve

04/30/2013
by   R. U. Gobithaasan, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/11/2020

Curvature of planar aesthetic curves

Farin proposed a method for designing Bezier curves with monotonic curva...
research
10/24/2021

Numerical reparametrization of periodic planar curves via curvature interpolation

A novel static algorithm is proposed for numerical reparametrization of ...
research
02/26/2018

Multiscale Planar Graph Generation

The study of network representations of physical, biological, and social...
research
06/30/2021

Logarithmic Weisfeiler-Leman Identifies All Planar Graphs

The Weisfeiler-Leman (WL) algorithm is a well-known combinatorial proced...
research
06/01/2022

Fairing of planar curves to log-aesthetic curves

We present an algorithm to fair a given planar curve by a log-aesthetic ...
research
09/02/2022

Can an NN model plainly learn planar layouts?

Planar graph drawings tend to be aesthetically pleasing. In this poster ...
research
10/11/2014

A mathematical design and evaluation of Bernstein-Bezier curves' shape features using the laws of technical aesthetics

We present some notes on the definition of mathematical design as well a...

Please sign up or login with your details

Forgot password? Click here to reset