scientific article; zbMATH DE number 1284386

MaRDI QIDQ4241978zbMATH OpenFDO

Authors Kees van Overveld

Publication date 3 January 2002

zbMATH Keywords

Jonkers-Corthout algorithmrecursive procedures

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Review text

This is the text of a lecture for secondary school teachers in which the author discusses the possibilities to generate sets of pixels that represent plane curves by means of recursive algorithms, in particular by means of the the Jonkers-Corthout algorithm from ca 1985. For the entire collection see [Zbl 0908.00021].

Recommendations

• A fortran procedure for drawing some space-filling curves
• scientific article; zbMATH DE number 4039361
• "Persian" Recursion
• Recursion in computer science curriculum
• scientific article; zbMATH DE number 4175877

Cited in

(1)

• "Persian" Recursion

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4241978)