Grafisk programmering

Computergrafik umfasst die Erzeugung und Darstellung von einfachen Grafikelementen und Bildern bis hin zur Virtual Reality. Die Anwendung dieser Techniken profitiert von einem soliden Verstandnis der entsprechenden Grundlagen. Das erfolgreiche Buch von Prof. Klawonn, das jetzt bereits in der dritten Auflage vorliegt, vermittelt genau das - verstandlich und nachvollziehbar. Prof. Klawonn erlautert die wesentlichen Konzepte an konkreten Beispielen und bedient sich dabei der einfachen Sprachmittel der Javaprogrammierung. Die Umsetzung erfolgt praktisch mit Java 2D und Java 3D. Auch zur dritten Auflage gibt es wieder einen umfangreichen Online-Service mit Beispielprogrammen, Aufgaben und Losungen, Folien und farbigen Illustrationen.

An open source project backed by years of continual development, ImageMagick supports over 90 image formats and can perform impressive operations such as creating images from scratch, changing colors, stretching, rotating, and overlaying images, and overlaying text on images. Whether you use ImageMagick to manage the family photos or to embark on a job involving millions of images, this book will provide you with the knowledge to manage your images with ease.The Definitive Guide to ImageMagick explains all of these capabilities and more in a practical, learn-by-example fashion. You’ll get comfortable using ImageMagick for any image-processing task. Through the books coverage of the ImageMagick interfaces for C, Perl, PHP, and Ruby, you’ll learn how to incorporate ImageMagick features into a variety of applications.

This volume contains the proceedings of two recent conferences in the ?eld of electronic publishing and digital documents: - DDEP 2000, the 8th International Conference on Digital Documents and Electronic Publishing, the successor conference to the EP conference series; and - PODDP 2000, the 5th International Workshop on the Principles of Digital Document Processing. Both conferences were held at the Technische Universit* at Munc * hen, Munich, Germany in September 2000. DDEP 2000 was the eighth in a biennial series of international conferences organized to promote the exchange of novel ideas concerning the computer p- duction, manipulation and dissemination of documents. This conference series has attempted to re?ect the evolving nature and usage of documents by treating digital documents and electronic publishing as a broad topic covering many - pects. These aspects have included document models, document representation and document dissemination, dynamic and hyper-documents, document ana- sis and management, and wide-ranging applications. The papers presented at DDEP 2000 and in this volume re?ect this broad view, and cover such diverse topicsashypermediastructureanddesign,multimediaauthoringtechniquesand systems, document structure inference, typography, document management and adaptation, document collections and Petri nets. All papers were refereed by an international program committee.

A representation of objects by their parts is the dominant strategy for representing complex 3D objects in many disciplines. In computer vision and robotics, superquadrics are among the most widespread part models. Superquadrics are a family of parametric models that cover a wide variety of smoothly changing 3D symmetric shapes, which are controlled with a small number of parameters and which can be augmented with the addition of global and local deformations. The book covers, in depth, the geometric properties of superquadrics. The main contribution of the book is an original approach to the recovery and segmentation of superquadrics from range images. Several applications of superquadrics in computer vision and robotics are thoroughly discussed and, in particular, the use of superquadrics for range image registration is demonstrated. Audience: The book is intended for readers of all levels who are familiar with and interested in computer vision issues.

The technique of randomization has been employed to solve numerous prob­ lems of computing both sequentially and in parallel. Examples of randomized algorithms that are asymptotically better than their deterministic counterparts in solving various fundamental problems abound. Randomized algorithms have the advantages of simplicity and better performance both in theory and often in practice. This book is a collection of articles written by renowned experts in the area of randomized parallel computing. A brief introduction to randomized algorithms In the aflalysis of algorithms, at least three different measures of performance can be used: the best case, the worst case, and the average case. Often, the average case run time of an algorithm is much smaller than the worst case. 2 For instance, the worst case run time of Hoare's quicksort is O(n ), whereas its average case run time is only O( n log n). The average case analysis is conducted with an assumption on the input space. The assumption made to arrive at the O( n log n) average run time for quicksort is that each input permutation is equally likely. Clearly, any average case analysis is only as good as how valid the assumption made on the input space is. Randomized algorithms achieve superior performances without making any assumptions on the inputs by making coin flips within the algorithm. Any analysis done of randomized algorithms will be valid for all p0:.sible inputs.

Bei der Entwicklung von Software- und Informationssystemen werden verschiedene Aspekte von Struktur und Verhalten eines Systems modelliert. Dazu stehen unterschiedliche Modellierungssprachen zur Verfugung. Das Fachgebiet Modellierung befat sich mit derartigen Modellen sowie mit ihren Beziehungen untereinander und auch mit dem Proze der Modellerstellung. Der Workshop Modellierung wird 1999 zum zweiten Mal von sieben Fachgruppen der Gesellschaft fur Informatik veranstaltet. Dieser Tagungsband enthalt 11 Fachbeitrage, die reprasentativ fur die verschiedenen Aspekte des Themas Modellierung stehen. Zusatzlich sind Diskussionsbeitrage zu drei sehr aktuellen Fragestellungen im Zusammenhang mit Modellierung enthalten.

Dieser Band enthalt die Beitrage zur AUSTROGRAPHICS '88, einer in zweijahrigem Turnus durchgefuhrten deutschsprachigen Tagung uber Graphische Datenverarbeitung. Die Tagung fand vom 28. bis 30. September 1988 an der Technischen Universitat Wien statt. Mit Rucksicht auf das in der gleichen Woche ebenfalls in Wien veranstaltete GI-Fachgesprach zum Thema Visualisierungstechniken und Algorithmen (Informatik-Fachberichte Band 182) liegen die Akzente der AUSTROGRAPHICS '88 diesmal auf anderen Gebieten. Nach einem Kapitel uber neue Algorithmen der Graphischen Datenverarbeitung folgen Beitrage zu den Themenkreisen Graphische Benutzerschnittstellen, Kartographie, Hardware und Netze. Einen regelrechten Schwerpunkt bilden die Kapitel Freiformflachen und Geometrische Algorithmen.

This two-volume set constitutes the refereed proceedings of the 5th European Conference on Computer Vision, ECCV'98, held in Freiburg, Germany, in June 1998.The 42 revised full papers and 70 revised posters presented were carefully selected from a total of 223 papers submitted. The papers are organized in sections on multiple-view geometry, stereo vision and calibration, geometry and invariances, structure from motion, colour and indexing, grouping and segmentation, tracking, condensation, matching and registration, image sequences and video, shape and shading, motion and flow, medical imaging, appearance and recognition, robotics and active vision, and motion segmentation.

This book constitutes the joint refereed proceedings of the 14th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2011, and the 15th International Workshop on Randomization and Computation, RANDOM 2011, held in Princeton, New Jersey, USA, in August 2011. The volume presents 29 revised full papers of the APPROX 2011 workshop, selected from 66 submissions, and 29 revised full papers of the RANDOM 2011 workshop, selected from 64 submissions. They were carefully reviewed and selected for inclusion in the book. In addition two abstracts of invited talks are included.APPROX focuses on algorithmic and complexity issues surrounding the development of efficient approximate solutions to computationally difficult problems. RANDOM is concerned with applications of randomness to computational and combinatorial problems.