Search results for "data structures and algorithms in java"
Items we need to order for you
Algorithms for Graphics and Image Processing
The technological developments of the last ten years have made com puter graphics and image processing by computer popular. Pictorial pat tern recognition has also shown significant progress. Clearly, there exist overlapping interests among the three areas of research. Graphic displays are of concern to anyone involved in image processing or pic torial pattern recognition and many problems in graphics require methodologies from image processing for their solutions. The data structures used in all three areas are similar. It seems that there is a common body of knowledge underlying all three areas, pictorial informa tion processing by computer. The novelty of these fields makes it difficult to design a course or to a write a book covering their basic concepts. Some of the treatises on graphics focus on the hardware and methods of current interest while treatises on image processing often emphasize applications and classical signal processing. The fast evolution of technology causes such material to lose its relevance. For example, the development of optical fibers has reduced the importance of bandwidth compression.
R 3,064.65
Pictorial Data Analysis
This volume is the collection of lectures and presentations of the NATO AS! On Pictorial Data Analysis, held August 1-12, 1982 in the beautiful chateau de Bonas, Bonas France. The director of the AS! was Robert M. Haralick and the Co-director was Stefano Levialdi. The papers in the book are arranged in two sections first theory and general prinicples and then applications. Local computations play a central role in image processing both when a traditional computer is used and when parallel machines are used for improving image throughput. Levialdi reviews such neighborhood operators. Hung and Kasvand discuss a line thinning application which involves detection of critical points on chain encoded data. Most low level image processing has been done using the digital raster as the basic data structure. Within the last few years many of these basic algorithms have been developed for the quadtree data structure. The quadtree permits easier access to certain kinds of spatial adjacency relationships in a variable resolution context. Rosenfeld reviews the properties of these representations and their uses in image segmentation and property measurement. Besslich discusses an expanded form of an invertible quadtree representation which permits a multiprocessor execution. Gisolfi and Vitulano discuss the C-matrix and C-filtering technique for image and texture feature extraction. O'mara et.al. discuss the application of Codel numbers to image feature extraction. Kropatsch discusses an image segmentation technique which permits the effective use of a variety of different kinds of segmentation techniques.
R 3,232.24
AAD Algorithms-Aided Design
Algorithmic design is not simply the use of computer to design architecture and objects. Algorithms allow designers to overcome the limitations of traditional CAD software and 3D modelers, reaching a level of complexity and control which is beyond the human manual ability. Algorithms-Aided Design presents design methods based on the use of Grasshopper®, a visual algorithm editor tightly integrated with Rhinoceros®, the 3D modeling software by McNeel & Associates allowing users to explore accurate freeform shapes. The book provides computational techniques to develop and control complex geometries, covering parametric modeling, digital fabrication techniques, form-finding strategies, environmental analysis and structural optimization. It also features case studies and contributions by researchers and designers from world's most influential universities and leading architecture firms.
R 1,751.00
