Log In Sign Up

String Art: Circle Drawing Using Straight Lines

by   Sankar K, et al.

An algorithm to generate the locus of a circle using the intersection points of straight lines is proposed. The pixels on the circle are plotted independent of one another and the operations involved in finding the locus of the circle from the intersection of straight lines are parallelizable. Integer only arithmetic and algorithmic optimizations are used for speedup. The proposed algorithm makes use of an envelope to form a parabolic arc which is consequent transformed into a circle. The use of parabolic arcs for the transformation results in higher pixel errors as the radius of the circle to be drawn increases. At its current state, the algorithm presented may be suitable only for generating circles for string art.


On the number of intersection points of lines and circles in ℝ^3

We consider the following question: Given n lines and n circles in ℝ^3, ...

Finding a Maximum Clique in a Grounded 1-Bend String Graph

A grounded 1-bend string graph is an intersection graph of a set of poly...

Cubic Planar Graphs that cannot be Drawn on few Lines

For every integer ℓ, we construct a cubic 3-vertex-connected planar bipa...

A simple en,ex marking rule for degenerate intersection points in 2D polygon clipping

A simple en,ex rule to mark the intersection points of 2D input polygon ...

Towards a characterization of stretchable aligned graphs

We consider the problem of stretching pseudolines in a planar straight-l...

On Intersecting IFS Fractals with Lines

IFS fractals - the attractors of Iterated Function Systems - have motiva...

The FaCells. An Exploratory Study about LSTM Layers on Face Sketches Classifiers

Lines are human mental abstractions. A bunch of lines may form a drawing...