|
Lecturer(s)
|
|
|
|
Course content
|
Introduction to computer graphics. HW and SW resources. Utilization and importance of computer graphics. Using of graphics library Borland Delphi. Basic raster graphics algorithms for driving 2D primitives. Scan converting lines, circles and ellipses. Antialiasing. Filling algorithms. Filling polygons in a raster and vector world. Clipping algorithms. Clipping lines and polygons to rectangular regions and other polygons. Geometrical transformation 2D. Special problems of text. Representation of curves. Parametric cubic curves - Hermite, Bézier and Coons curves. B-splines. Coordinate systems. Solid modelling. Boundary representation. Constructive solid geometry. Viewing in 3D. Perspective and parallel projections. Algorithms for visible-surface determination and visible-line determination. Composition of 3D transformation. The raster graphic problems. Colour spaces, gamut and colour palette. Algorithm to decrease colour depth. Noise reduction methods. Colour transformations, brightness and contrast adjustment. Histogram. Modify image size - resampling and resizing. Most practically used image formats.
|
|
Learning activities and teaching methods
|
|
Monologic (reading, lecture, briefing), Demonstration, Projection, Skills training
|
|
Learning outcomes
|
This course aims to familiarise students with the fundamental and the most practically used algorithms and methods of the computers graphics including scan conversion of geometric primitives, 2D and 3D geometric transformations, clipping and filling, algorithms for visible surface determination, use of raster and vector graphics, demonstration of common image formats and next. The accent is given to the implementation of selected algorithm in Java using Swing.
After finishing the course the student is able to create simple graphical applications for display of raster and vector objects and applications for a basic adjustment of raster images. Student is able to use basic graphics instrument supported by the graphics library of Delphi. Student is able to implement the selected methods and algorithms of computer graphics.
|
|
Prerequisites
|
Assumed basic knowledge of PC operating system MS Windows. The foundations of algorithm development and basic programming experience in a higher programming language and elementary geometry and linear algebra acquirements are required.
|
|
Assessment methods and criteria
|
Oral examination, Written examination
Given assignment confirms that a student attended lessons to the extent required and fulfilled qualified requirements. Conditions for credit are: active work at exercises, min. 75% presence, one closing examination papers, student is successful if he/she obtains at minimum 50% of possible points.
|
|
Recommended literature
|
-
Foley, J. D., van Dam, A., Feiner, S. K., Hughes, J. F. Computer Graphics. Principles and Practice. Boston : Addison-Wesley, 1997. ISBN 0-201-84840-6.
-
Murray, J. D., Ryper, W. Encyklopedie grafických formátů II. Brno, Computer Press, 2000. ISBN 80-7226-033-2.
-
Murray, J. D., Ryper,W. Ecyclopedia of Graphics File Formats. 2nd Edition. New York: O`Reilly & Associates, 1996. ISBN 1-56592-161-5.
-
Polách, E. Algoritmy počítačové grafiky. České Budějovice : PFJU, 1995. ISBN 80-7040-119-2.
-
Žára, Jiří . Moderní počítačová grafika. Brno: Computer Press, 2004. ISBN 80-251-0454-0.
|