Fast exact digital differential analyzer for circle generation

04/17/2013
by   Jan L. Cieśliński, et al.
0

In the first part of the paper we present a short review of applications of digital differential analyzers (DDA) to generation of circles showing that they can be treated as one-step numerical schemes. In the second part we present and discuss a novel fast algorithm based on a two-step numerical scheme (explicit midpoint rule). Although our algorithm is as cheap as the simplest one-step DDA algoritm (and can be represented in terms of shifts and additions), it generates circles with maximal accuracy, i.e., it is exact up to round-off errors.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/03/2019

Explicit Stencil Computation Schemes Generated by Poisson's Formula for the 2D Wave Equation

A new approach to building explicit time-marching stencil computation sc...
research
11/25/2020

On a fast and nearly division-free algorithm for the characteristic polynomial

We review the Preparata-Sarwate algorithm, a simple O(n^3.5) method for ...
research
09/25/2019

Runge-Kutta Lawson schemes for stochastic differential equations

In this paper, we present a framework to construct general stochastic Ru...
research
03/28/2023

Second order stabilized two-step Runge-Kutta methods

Stabilized methods (also called Chebyshev methods) are explicit methods ...
research
11/23/2020

Fast sixth-order algorithm based on the generalized Cayley transform for the Zakharov-Shabat system in optical applications

Based on the generalized Cayley transform, a family of conservative one-...
research
07/15/2021

Using a template engine as a computer algebra tool

In research problems that involve the use of numerical methods for solvi...

Please sign up or login with your details

Forgot password? Click here to reset