Algorithms For Parallel Polygon Rendering (lecture Notes In Computer Science)
معرفی کتاب «Algorithms For Parallel Polygon Rendering (lecture Notes In Computer Science)» نوشتهٔ T. Theoharis (eds.)، منتشرشده توسط نشر Springer-Verlag Berlin Heidelberg در سال 1989. این کتاب در فرمت djvu، زبان انگلیسی ارائه شده است. «Algorithms For Parallel Polygon Rendering (lecture Notes In Computer Science)» در دستهٔ بدون دستهبندی قرار دارد.
this Book Is The Result Of The Research In The Implementation Of Polygon-based Graphics Operations On Certain General Purpose Parallel Processors; The Aim Is To Provide A Speed-up Over Sequential Implementations Of The Graphics Operations Concerned, And The Resulting Software Can Be Viewed As A Subset Of The Application Suites Of The Relevant Parallel Machines. A Literature Review And A Brief Description Of The Architectures Considered Give An Introduction Into The Field. Most Algorithms Are Consistently Presented In An Informally Defined Extension Of The Occam Language Which Includes Single Instruction Multiple Data Stream (simd) Data Types And Operations On Them. Original Methods For Polygon Rendering - Including The Operations Of Filling, Hidden Surface Elimination And Smooth Shading - Are Presented For Simd Architectures Like The Dap And For A Dual-paradigm (simd-mimd) Machine Constructed Out Of A Dap-like Processor Array And A Transputer Network. Polygon Clipping Algorithms For Both Transputer And The Dap Are Described And Contrasted. Apart From The Information Presented In The Book And The Useful Literature Survey, The Reader Can Also Expect To Gain An Insight Into The Programming Of The Relevant Parallel Machines.
"Computer vision seeks a process that starts with a noisy, ambiguous signal from a TV camera and ends with a high-level description of discrete objects located in 3-dimensional space and identified in a human classification. This book addresses the process at several levels. First to be treated are the low-level image-processing issues of noise removaland smoothing while preserving important lines and singularities in an image. At a slightly higher level, a robust contour tracing algorithm is described that produces a cartoon of the important lines in the image. Thirdis the high-level task of reconstructing the geometry of objects in the scene. The book has two aims: to give the computer vision community a new approach to early visual processing, in the form of image segmentation that incorporates occlusion at a low level, and to introduce real computer algorithms that do a better job than what most vision programmers use currently. The algorithms are: - a nonlinear filter that reduces noise and enhances edges, - an edge detector that also finds corners and produces smoothed contours rather than bitmaps, - an algorithm for filling gaps in contours."--PUBLISHER'S WEBSITE 1 Introduction....Pages 1-16 2 Graphics on general purpose parallel architectures....Pages 17-31 3 A parallel incremental rendering method....Pages 32-64 4 Parallel polygon rendering with precomputed surface patches....Pages 65-86 5 Parallel polygon rendering on a dual-paradigm parallel processor....Pages 87-111 6 Control parallel versus data parallel polygon clipping....Pages 112-131 7 Conclusion....Pages 132-134