𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An Efficient Circle-Drawing Algorithm

✍ Scribed by Yevgeni P. Kuzmin

Book ID
115215730
Publisher
John Wiley and Sons
Year
1990
Tongue
English
Weight
187 KB
Volume
9
Category
Article
ISSN
0167-7055

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An Efficient Randomized Algorithm for De
An Efficient Randomized Algorithm for Detecting Circles
✍ Teh-Chuan Chen; Kuo-Liang Chung πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 444 KB

Detecting circles from a digital image is very important in shape recognition. In this paper, an efficient randomized algorithm (RCD) for detecting circles is presented, which is not based on the Hough transform (HT). Instead of using an accumulator for saving the information of the related paramete

Draw the Circle
Draw the Circle
✍ Batterson, Mark πŸ“‚ Fiction πŸ“… 2012 πŸ› Zondervan 🌐 English βš– 136 KB
An algorithm for drawing planar graphs
An algorithm for drawing planar graphs
✍ Bor Plestenjak πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 382 KB πŸ‘ 2 views

A simple algorithm for drawing 3-connected planar graphs is presented. It is derived from the Fruchterman and Reingold spring embedding algorithm by deleting all repulsive forces and fixing vertices of an outer face. The algorithm is implemented in the system for manipulating discrete mathematical s