University of Iasi Faculty of Mathematics

 Grafica an III : MI, M   Cultura este ceea ce iti ramine dupa ce ai uitat totul.

 Lectii de Grafica
 Utile Programa analitica a cursului   Se recomanda: Algoritmi geometrici 2D si aplicatii in CAGD , Autor: M.I. Munteanu, Ed. Univ. Al.I.Cuza, Iasi 2005 Algoritmi de triangulare Autori: M.I.Munteanu, A.I.Nistor, Casa Editoriala Demiurg, 2008

 NEWS Consultatii:   Miercuri 11.00 - 12.00   Joi 16.00 - 17.00 la catedra de geometrie. Subiectele (partial 2010): S1. Fie P1(4,8) si P2(1,1). Sa sa aplice algoritmul de rasterizare al lui Bresenham. S2. Daca un punct are culoarea definita de RGB=(0.3, 0.4, 0.7) sa se gaseasca valorile in modelul de culoare CMY(K). S3. Fie punctele A(-4 , -9); B(-2, -7); C(3, -7); D(9, -9); E(3,2); F(0, 2); G(3,7); H(-3, 7); I(-3, -2); J(-6, 2); K(-6, -5). Sa se aplice algoritmul de umplere (fill) pentru poligonul obtinut folosind SET si AET. 1p oficiu, S1=1.5p, S2=2.5p, S3=5p
 Zbl 1086.65007 Munteanu, Marian-Ioan 2D geometric algorithms and applications in CAGD. (Algoritmi geometrici 2D si aplicatii în C.A.G.D.) (Romanian) [B] Iasi: Editura Universitatii ``Alexandru Ioan Cuza". 195~p. (2005). ISBN 973-703-805-0/pbk Problems related to the algorithmic design of curves and surfaces arose often from many industrial applications during the second half of the twentieth century. As consequence, new domains of research, included in the rich field of computer graphics, had an essential impact on the structural development of the academic programs. A good textbook for students both in mathematics and in computer sciences is presented, by the book under consideration, to all the Romanian universities. The ten chapters of the book include both techniques of bitmap graphics and vectorial graphics, coming finally to incremental algorithms. Chapter 1 contains a general presentation of the computer graphics and its main concepts. Chapters 2 and 3 deal with scan-conversion techniques. Colouring is presented in chapter 4, while various methods of generating geometrical configurations and improving their image are in chapters 6 (Filling), 7 (Clipping), 9 (Bézier curves), 10 (Spline cubics defined by Bézier cubics). Chapter 8 presents few elements of 2D-geometry for computer graphics, pointing the geometrical transformation of images: translation, zoom, rotation, etc. A presentation of the graphic functions in C, an appendix containing exercises for students accompanied by their solutions and a bibliography, including the most useful textbooks and fundamental books recommended to students, conclude the book. Each chapter presents well known algorithms together with new algorithms, resulting from the author's research work, that improve the performance of the usual techniques. \par The book is also useful to students in engineering, automation, for engineers using computer graphics and researchers in computers and engineering. MSC 2000: *65D17 Computer aided design (modeling of curves and surfaces) 65-01 Textbooks (numerical analysis) 65D07 Splines (numerical methods) 65D10 Smoothing 65D18 Computer graphics and computational geometry 68-01 Textbooks (computer science) 68U01 General 68U05 Computational geometry, etc. 68U07 Computer aided design Keywords: bitmap graphics; object oriented graphics; scan-conversion; colouring; antiliasing; filling; clipping; Bézier curve; computer-aided geometric design (CAGD); curves; surfaces; computer graphics; textbook; vectorial graphics; algorithms
 Zbl 1151.68052 Munteanu, Marian-Ioan, Ana-Irina Nistor Algorithms for triangulations. (Algoritmi de triangulare.) (Romanian) [B] Iaşi: Casa Editorială Demiurg. 172~p. (2008). ISBN 978-973-152-059-9/pbk The book presents the classical methods for triangulation, like the Graham Scan method, the Voronoi diagram method, and Delaunay triangulation, as well as optimization methods like the MaxMin principle or the Wall scheme. Another part deals with interesting applications, like art gallery supervision or archaeological reconstruction. The book is designed from a practical point of view and useful examples are provided in Matlab. MSC 2000: *68U05 Computational geometry, etc. 32B25 Triangulation and related questions 68U07 Computer aided design 65D18 Computer graphics and computational geometry Keywords: triangulation; computational geometry; Voronoi diagram