Answers are grounded in this paper and cite their sources.
An efficient algorithm is presented for drawing or displaying conic section curve segments, each incremental move being chosen by the computer to minimize the displacement from the intended curve. The inner cycle consists of three additions and one test for each move. Two further additions are required for display devices which do not accept incremental commands, and two further tests are required to detect possible changes of sector.
No takes yet. Share an insight, caveat, or question.
M. L. V. Pitteway (1967) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: