48%
Graphics Gems: (Graphics Gems - IBM)

Graphics Gems: (Graphics Gems - IBM)

          
5
4
3
2
1

Out of Stock


Premium quality
Premium quality
Bookswagon upholds the quality by delivering untarnished books. Quality, services and satisfaction are everything for us!
Easy Return
Easy return
Not satisfied with this product! Keep it in original condition and packaging to avail easy return policy.
Certified product
Certified product
First impression is the last impression! Address the book’s certification page, ISBN, publisher’s name, copyright page and print quality.
Secure Checkout
Secure checkout
Security at its finest! Login, browse, purchase and pay, every step is safe and secured.
Money back guarantee
Money-back guarantee:
It’s all about customers! For any kind of bad experience with the product, get your actual amount back after returning the product.
On time delivery
On-time delivery
At your doorstep on time! Get this book delivered without any delay.
Notify me when this book is in stock
Add to Wishlist

About the Book

"The GRAPHICS GEMS Series" was started in 1990 by Andrew Glassner. The vision and purpose of the Series was - and still is - to provide tips, techniques, and algorithms for graphics programmers. All of the gems are written by programmers who work in the field and are motivated by a common desire to share interesting ideas and tools with their colleagues. Each volume provides a new set of innovative solutions to a variety of programming problems.

Table of Contents:
Preface Introduction Mathematical Notation Pseudo-Code Contributors 1 2D Geometry Useful 2D Geometry Trigonometry Summary Useful Trigonometry Trigonometric Functions at Select Points Triangles Generating Random Points in Triangles (649) Fast Line-Edge Intersections on a Uniform Grid (651) Anti-Aliasing Summary Area of Intersection: Circle and a Half-Plane Area of Intersection: Circle and a Thick Line Area of Intersection: Two Circles Vertical Distance from a Point to a Line A Fast 2D Point-on-Line Test (654) Fast Circle-Rectangle Intersection Checking (656) 2 2D Rendering Circles of Integral Radius on Integer Lattices Nice Numbers for Graph Labels (657) Efficient Generation of Sampling Jitter Using Look-up Tables (660) Scan Conversion Summary Fast Anti-Aliasing Polygon Scan Conversion (662) Generic Convex Polygon Scan Conversion and Clipping (667) Concave Polygon Scan Conversion (681) Fast Scan Conversion of Arbitrary Polygons Line-Drawing Summary Digital Line Drawing (685) Symmetric Double Step Line Algorithm (686) Rendering Anti-Aliased Lines (690) An Algorithm for Filling in 2D Wide Line Bevel Joints Rendering Fat Lines on a Raster Grid Two-Dimensional Clipping: A Vector-Based Approach (694) Periodic Tilings of the Plane on a Raster Grid 3 Image Processing Anti-Aliasing Filters Summary Convenient Anti-Aliasing Filters that Minimize "Bumpy" Sampling Filters for Common Resampling Tasks Smoothing Enlarged Monochrome Images Median Finding on a 3 X 3 Grid (711) Ordered Dithering (713) A Fast Algorithm for General Raster Rotation Useful 1-to-1 Pixel Transforms Alpha Blending 4 Frame Buffer Techniques Frame Buffers and Color Maps Reading a Write-Only Write Mask A Digital "Dissolve" Effect (715) Mapping RGB Triples onto Four Bits (718) What are the Coordinates of a Pixel? Proper Treatment of Pixels as Integers (719) Normal Coding Recording Animation in Binary Order for Progressive Temporal Refinement (720) 1-to-1 Pixel Transforms Optimized Through Color-Map Manipulation A Seed Fill Algorithm (721) Filling a Region in a Frame Buffer Precalculating Addresses for Fast Fills, Circles, and Lines A Simple Method for Color Quantization: Octree Quantization 5 3D Geometry Useful 3D Geometry An Efficient Bounding Sphere (723) Intersection of Two Lines in Three-Space Intersection of Three Planes Mapping Summary Digital Cartography for Computer Graphics Albers Equal-Area Conic Map Projection (726) Boxes and Spheres Summary Spheres-to-Voxels Conversion A Simple Method for Box-Sphere Intersection Testing (730) 6 3D Rendering 3D Grid Hashing Function (733) Backface Culling Fast Dot Products for Shading Scanline Depth Gradient of a Z-Buffered Triangle Simulating Fog and Haze Interpretation of Texture Map Indices Multidimensional Sum Tables 7 Ray Tracing A Simple Ray Rejection Test Ray-Object Intersection Summary Intersection of a Ray with a Sphere An Efficient Ray-Polygon Intersection (735) Fast Ray-Polygon Intersection Fast Ray-Box Intersection (736) Shadow Attenuation for Ray Tracing Transparent Objects 8 Numerical and Programming Techniques Root Finding Summary Cubic and Quartic Roots (738) A Bézier Curve-Based Root-Finder (787) Using Sturm Sequences to Bracket Real Roots of Polynomial Equations (743) Distance Measures Summary A High-Speed, Low Precision Square Root (756) A Fast Approximation to the Hypotenuse (758) A Fast Approximation to 3D Euclidean Distance Full-Precision Constants Converting Between Bits and Digits Storage-Free Swapping Generating Random Integers Fast 2D-3D Rotation Bit Patterns for Encoding Angles Bit Interleaving for Quad- or Octrees (759) A Fast HSL-to-RGB Transform (763) 9 Matrix Techniques Matrix Identities Rotation Matrix Methods Summary Transforming Axes Fast Matrix Multiplication A Virtual Trackball Matrix Orthogonalization (765) Rotation Tools Matrix Inversion (766) Matrices and Transformations Efficient Post-Concatenation of Transformation Matrices (770) 10 Modeling and Transformations Transformation Identities Fixed-Point Trigonometry with CORDIC Iterations (773) Using Quaternions for Coding 3D Transformations (775) 3D Viewing and Rotation Using Orthonormal Bases (778) The Use of Coordinate Frames in Computer Graphics Forms, Vectors, and Transforms (780) Properties of Surface-Normal Transformations Transforming Axis-Aligned Bounding Boxes (785) Constructing Shapes Summary Defining Surfaces from Sampled Data Defining Surfaces from Contour Data Computing Surface Normals for 3D Models Calculation of Reference Frames Along a Space Curve 11 Curves and Surfaces Planar Cubic Curves Explicit Cubic Spline Interpolation Formulas Fast Spline Drawing Some Properties of Bézier Curves Tutorial on Forward Differencing Integration of Bernstein Basis Functions Solving the Nearest-Point-on-Curve Problem (787) An Algorithm for Automatically Fitting Digitized Curves (797) C Appendix I: C Utilities Graphics Gems C Header File 2D and 3D Vector C Library Memory Allocation in C Two Useful C Macros How To Build Circular Structures in C How To Use C Register Variables to Point to 2D Arrays C Appendix 2: C Implementations The C Code Follows the Same Order as the Gems References Index


Best Sellers


Product Details
  • ISBN-13: 9780122861666
  • Publisher: Elsevier Science & Technology
  • Publisher Imprint: Morgan Kaufmann Publishers In
  • Edition: New edition
  • Language: English
  • Series Title: Graphics Gems - IBM
  • Width: 38.100 mm
  • ISBN-10: 0122861663
  • Publisher Date: 05 Jan 1994
  • Binding: Hardback
  • Height: 247.650 mm
  • No of Pages: 864
  • Weight: 1560 gr


Similar Products

How would you rate your experience shopping for books on Bookswagon?

Add Photo
Add Photo

Customer Reviews

REVIEWS           
Click Here To Be The First to Review this Product
Graphics Gems: (Graphics Gems - IBM)
Elsevier Science & Technology -
Graphics Gems: (Graphics Gems - IBM)
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Graphics Gems: (Graphics Gems - IBM)

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book
    Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!
    ASK VIDYA