Algorithmic paradigms: examples in computational geometry

Authors:
N. Adlai A. De Pano
Affiliations:
Univ. of New Orleans, New Oreans, LA
Venue:
SIGCSE '88 Proceedings of the nineteenth SIGCSE technical symposium on Computer science education
Year:
1988

Citing 0
Cited 2

Pictures as invariants

SIGCSE '91 Proceedings of the twenty-second SIGCSE technical symposium on Computer science education
Algorthmic pradigms: examples in computational geometry II

SIGCSE '90 Proceedings of the twenty-first SIGCSE technical symposium on Computer science education

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a collection of algorithms that solve problems from the realm of computational geometry to illustrate several basic notions in algorithm design and analysis. Computational geometry is a young discipline that has much to offer both as a field of research and as a source of instruction materials. This paper aims to serve a dual purpose by (a) outlining results that might prick the interest of researchers looking for greener pastures (so to speak) for investigation; and (b) showing the pedagogic value of these results for teachers of algorithm design and analysis.