⭐ 欢迎来到虫虫下载站！ | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站
📤 上传资源

📄 category.html

📁 [Game.Programming].Academic - Graphics Gems (6 books source code)
💻 HTML
字号:
🔍 
<html>
<head>
<title>Graphics Gems, by Category</title>
</head>
<body>
<H1>Graphics Gems, by Category</H1>
Listed by category. Note that some gems may be listed more than once.
<P><B><a href="#2D Geometry_link">2D Geometry</a><BR>
<a href="#2D Rendering_link">2D Rendering</a><BR>
<a href="#3D Geometry_link">3D Geometry</a><BR>
<a href="#3D Rendering_link">3D Rendering</a><BR>
<a href="#C Utilities_link">C Utilities</a><BR>
<a href="#Curves and Surfaces_link">Curves and Surfaces</a><BR>
<a href="#Frame Buffer Techniques_link">Frame Buffer Techniques</a><BR>
<a href="#Image Processing_link">Image Processing</a><BR>
<a href="#Matrix Techniques_link">Matrix Techniques</a><BR>
<a href="#Modeling and Transformations_link">Modeling and Transformations</a><BR>
<a href="#Numerical and Programming Techniques_link">Numerical and Programming Techniques</a><BR>
<a href="#Radiosity_link">Radiosity</a><BR>
<a href="#Ray Tracing_link">Ray Tracing</a><BR>
</B>
<P>
<I><a href="index.html">return to main page</a></I>
<HR>
<P><H2><a name="2D Geometry_link">2D Geometry</a></H2>
Glassner, Andrew, 
<B>Useful 2D Geometry</B>,
<I>Graphics Gems</I>, p. 3-11.<BR>

Glassner, Andrew, 
<B>Useful Trigonometry</B>,
<I>Graphics Gems</I>, p. 13-17.<BR>

Paeth, Alan W., 
<B>Trigonometric Functions at Select Points</B>,
<I>Graphics Gems</I>, p. 18-19.<BR>

Goldman, Ronald, 
<B>Triangles</B>,
<I>Graphics Gems</I>, p. 20-23.<BR>

Turk, Greg, 
<B>Generating Random Points in Triangles</B>,
<I>Graphics Gems</I>, p. 24-28, code: p. 649-650, <a href="gems/TriPoints.c">TriPoints.c</a>.<BR>

Shapira, Andrew, 
<B>Fast Line-Edge Intersections on a Uniform Grid</B>,
<I>Graphics Gems</I>, p. 29-36, code: p. 651-653, <a href="gems/LineEdge.c">LineEdge.c</a>.<BR>

Thompson, Kelvin, 
<B>Area of Intersection: Circle and a Half-Plane</B>,
<I>Graphics Gems</I>, p. 38-39.<BR>

Thompson, Kelvin, 
<B>Area of Intersection: Circle and a Thick Line</B>,
<I>Graphics Gems</I>, p. 40-42.<BR>

Thompson, Kelvin, 
<B>Area of Intersection: Two Circles</B>,
<I>Graphics Gems</I>, p. 43-46.<BR>

Thompson, Kelvin, 
<B>Vertical Distance from a Point to a Line</B>,
<I>Graphics Gems</I>, p. 47-48.<BR>

Paeth, Alan W., 
<B>A Fast 2D Point-on-line Test</B>,
<I>Graphics Gems</I>, p. 49-50, code: p. 654-655, <a href="gems/PntOnLine.c">PntOnLine.c</a>.<BR>

Shaffer, Clifford A., 
<B>Fast Circle-Rectangle Intersection Checking</B>,
<I>Graphics Gems</I>, p. 51-53, code: p. 656, <a href="gems/CircleRect.c">CircleRect.c</a>.<BR>

Glassner, Andrew, 
<B>2D and 3D Vector C Library</B>,
<I>Graphics Gems</I>, p. 633-642, code: p. 633-642, <a href="gems/GGVecLib.c">GGVecLib.c</a>  <a href="gems/GraphicsGems.h">GraphicsGems.h</a>.<BR>

Rokne, Jon, 
<B>The Area of a Simple Polygon</B>,
<I>Graphics Gems II</I>, p. 5-6.<BR>

Prasad, Mukesh, 
<B>Intersection of Line Segments</B>,
<I>Graphics Gems II</I>, p. 7-9, code: p. 473-476, <a href="gemsii/xlines.c">xlines.c</a>.<BR>

Morrison, Jack C., 
<B>Distance From a Point To a Line</B>,
<I>Graphics Gems II</I>, p. 10-13.<BR>

Rokne, Jon, 
<B>An Easy Bounding Circle</B>,
<I>Graphics Gems II</I>, p. 14-16.<BR>

Rokne, Jon, 
<B>The Smallest Circle Containing the Intersection of Two Circles</B>,
<I>Graphics Gems II</I>, p. 17-18.<BR>

Rokne, Jon, 
<B>Appolonius's 10th Problem</B>,
<I>Graphics Gems II</I>, p. 19-24.<BR>

Musgrave, F. Kenton, 
<B>A Peano Curve Generation Algorithm</B>,
<I>Graphics Gems II</I>, p. 25, code: p. 477-484, <a href="gemsii/Peano/">Peano/</a>.<BR>

Voorhies, Douglas, 
<B>Space-Filling Curves and a Measure of Coherence</B>,
<I>Graphics Gems II</I>, p. 26-30, code: p. 485-486, <a href="gemsii/Hilbert.c">Hilbert.c</a>.<BR>

Steinhart, Jonathan E., 
<B>Scanline Coherent Shape Algebra</B>,
<I>Graphics Gems II</I>, p. 31-45, code: p. 487-501.<BR>

Goldman, Ronald, 
<B>Area of Planar Polygons and Volume of Polyhedra</B>,
<I>Graphics Gems II</I>, p. 170-171.<BR>

Glassner, Andrew, and Bogart, Rod G., 
<B>2D and 3D Vector C Library</B>,
<I>Graphics Gems II</I>, p. 458-466, code: p. 633-642, <a href="gemsii/GGVecLib.c">GGVecLib.c</a>  <a href="gemsii/GraphicsGems.h">GraphicsGems.h</a>.<BR>

Van Aken, Jerry, and Simar, Ray, 
<B>A Parametric Elliptical Arc Algorithm</B>,
<I>Graphics Gems III</I>, p. 164-172, code: p. 478-479, <a href="gemsiii/parelarc.c">parelarc.c</a>.<BR>

Rosati, Claudio, 
<B>A Simple Connection Algorithm for 2-D Drawing</B>,
<I>Graphics Gems III</I>, p. 173-181, code: p. 480-486, <a href="gemsiii/con2d.c">con2d.c</a>.<BR>

Srinivasan, Raman V., 
<B>A Fast Circle Clipping Algorithm</B>,
<I>Graphics Gems III</I>, p. 182-187, code: p. 487-490, <a href="gemsiii/circlexc.c">circlexc.c</a>.<BR>

Shaffer, Clifford A., and Feustel, Charles D., 
<B>Exact Computation of 2-D Intersections</B>,
<I>Graphics Gems III</I>, p. 188-192, code: p. 491-495, <a href="gemsiii/Polyintr.c">Polyintr.c</a>.<BR>

Miller, Robert D., 
<B>Joining Two Lines with a Circular Arc Fillet</B>,
<I>Graphics Gems III</I>, p. 193-198, code: p. 496-499, <a href="gemsiii/fillet.c">fillet.c</a>.<BR>

Antonio, Franklin, 
<B>Faster Line Segment Intersection</B>,
<I>Graphics Gems III</I>, p. 199-202, code: p. 500-501, <a href="gemsiii/insectc.c">insectc.c</a>.<BR>

Sevici, Constantin A., 
<B>Solving the Problem of Apollonius and Other Related Problems</B>,
<I>Graphics Gems III</I>, p. 203-209.<BR>

Bashein, Gerard, and Detmer, Paul R., 
<B>Centroid of a Polygon</B>,
<I>Graphics Gems IV</I>, p. 3-6, code: p. 5, <a href="gemsiv/centroid.c">centroid.c</a>.<BR>

Schorn, Peter, and Fisher, Frederick, 
<B>Testing the Convexity of a Polygon</B>,
<I>Graphics Gems IV</I>, p. 7-15, code: p. 11-15, <a href="gemsiv/convex_test/">convex_test/</a>.<BR>

Weiler, Kevin, 
<B>An Incremental Angle Point in Polygon Test</B>,
<I>Graphics Gems IV</I>, p. 16-23, code: p. 17-22, <a href="gemsiv/ptpoly_weiler/">ptpoly_weiler/</a>.<BR>

Haines, Eric, 
<B>Point in Polygon Strategies</B>,
<I>Graphics Gems IV</I>, p. 24-46, code: p. 34-45, <a href="gemsiv/ptpoly_haines/">ptpoly_haines/</a>.<BR>

Lischinski, Dani, 
<B>Incremental Delaunay Triangulation</B>,
<I>Graphics Gems IV</I>, p. 47-59, code: p. 51-58, <a href="gemsiv/delaunay/">delaunay/</a>.<BR>

Hill, F. S., Jr., 
<B>The Pleasures of `Perp Dot' Products</B>,
<I>Graphics Gems IV</I>, p. 138-148.<BR>

Hanson, Andrew J., 
<B>Geometry for N-Dimensional Graphics</B>,
<I>Graphics Gems IV</I>, p. 149-170.<BR>

Glassner, Andrew, and Haines, Eric, 
<B>C Header File and Vector Library</B>,
<I>Graphics Gems IV</I>, p. 558-570, code: p. 558-570, <a href="gemsiv/GraphicsGems.c">GraphicsGems.c</a>  <a href="gemsiv/GraphicsGems.h">GraphicsGems.h</a>.<BR>

Van Gelder, Allen, 
<B>Efficient Computation of Polygon Area and Polyhedron Volume</B>,
<I>Graphics Gems V</I>, p. 35-41.<BR>

Glassner, Andrew, 
<B>Clipping a Concave Polygon</B>,
<I>Graphics Gems V</I>, p. 50-54.<BR>

Hanson, Andrew J., 
<B>Rotations for N-dimensional Graphics</B>,
<I>Graphics Gems V</I>, p. 55-64.<BR>

Hill, Kenneth J., 
<B>Matrix-based Ellipse Geometry</B>,
<I>Graphics Gems V</I>, p. 72-77, code:  <a href="gemsv/ch2-6/">ch2-6/</a>.<BR>

Narkhede, Atul, and Manocha, Dinesh, 
<B>Fast Polygon Triangulation Based on Seidel's Algorithm</B>,
<I>Graphics Gems V</I>, p. 394-397, code:  <a href="gemsv/ch7-5/">ch7-5/</a>.<BR>

<P><H2><a name="2D Rendering_link">2D Rendering</a></H2>
Paeth, Alan W., 
<B>Circles of Integral Radius on Integer Lattices</B>,
<I>Graphics Gems</I>, p. 57-60.<BR>

Heckbert, Paul S., 
<B>Nice Numbers for Graph Labels</B>,
<I>Graphics Gems</I>, p. 61-63, code: p. 657-659, <a href="gems/Label.c">Label.c</a>.<BR>

Cychosz, Joseph M., 
<B>Efficient Generation of Sampling Jitter Using Look-up Tables</B>,
<I>Graphics Gems</I>, p. 64-74, code: p. 660-661, <a href="gems/FastJitter.c">FastJitter.c</a>.<BR>

Morrison, Jack C., 
<B>Fast Anti-Aliasing Polygon Scan Conversion</B>,
<I>Graphics Gems</I>, p. 76-83, code: p. 662-666, <a href="gems/AAPolyScan.c">AAPolyScan.c</a>.<BR>

Heckbert, Paul S., 
<B>Generic Convex Polygon Scan Conversion and Clipping</B>,
<I>Graphics Gems</I>, p. 84-86, code: p. 667-680, <a href="gems/PolyScan/">PolyScan/</a>.<BR>

Heckbert, Paul S., 
<B>Concave Polygon Scan Conversion</B>,
<I>Graphics Gems</I>, p. 87-91, code: p. 681-684, <a href="gems/ConcaveScan.c">ConcaveScan.c</a>.<BR>

Wallis, Bob, 
<B>Fast Scan Conversion of Arbitrary Polygons</B>,
<I>Graphics Gems</I>, p. 92-97.<BR>

Heckbert, Paul S., 
<B>Digital Line Drawing</B>,
<I>Graphics Gems</I>, p. 99-100, code: p. 685, <a href="gems/DigitalLine.c">DigitalLine.c</a>.<BR>

Wyvill, Brian, 
<B>Symmetric Double Step Line Algorithm</B>,
<I>Graphics Gems</I>, p. 101-104, code: p. 686-689, <a href="gems/DoubleLine.c">DoubleLine.c</a>.<BR>

Thompson, Kelvin, 
<B>Rendering Anti-Aliased Lines</B>,
<I>Graphics Gems</I>, p. 105-106, code: p. 690-693, <a href="gems/AALines/">AALines/</a>.<BR>

Ritter, Jack, 
<B>An Algorithm for Filling in 2D Wide Line Bevel Joints</B>,
<I>Graphics Gems</I>, p. 107-113.<BR>

Wallis, Bob, 
<B>Rendering Fat Lines on a Raster Grid</B>,
<I>Graphics Gems</I>, p. 114-120.<BR>

Spoelder, Hans J.W., and Ullings, Fons H., 
<B>Two-Dimensional Clipping: A Vector-Based Approach</B>,
<I>Graphics Gems</I>, p. 121-128, code: p. 694-710, <a href="gems/2DClip/">2DClip/</a>.<BR>

Lee, Greg, Penk, Mike, and Wallis, Bob, 
<B>Periodic Tilings of the Plane on a Raster Grid</B>,
<I>Graphics Gems</I>, p. 129-139.<BR>

Steinhart, Jonathan E., 
<B>Scanline Coherent Shape Algebra</B>,
<I>Graphics Gems II</I>, p. 31-45, code: p. 487-501.<BR>

Cheng, Russell C.H., 
<B>Edge and Bit-Mask Calculations for Anti-Aliasing</B>,
<I>Graphics Gems III</I>, p. 349-354, code: p. 586-593, <a href="gemsiii/edgeCalc.c">edgeCalc.c</a>.<BR>

Grace, Thom, 
<B>Fast Span Conversion: Unrolling Short Loops</B>,
<I>Graphics Gems III</I>, p. 355-357, code: p. 594-596, <a href="gemsiii/fastSpan.c">fastSpan.c</a>.<BR>

Hollasch, Steve, 
<B>Progressive Image Refinement via Gridded Sampling</B>,
<I>Graphics Gems III</I>, p. 358-361, code: p. 597-598, <a href="gemsiii/PIR.c">PIR.c</a>.<BR>

Fleischer, Kurt, and Salesin, David, 
<B>Accurate Polygon Scan Conversion Using Half-Open Intervals</B>,
<I>Graphics Gems III</I>, p. 362-365, code: p. 599-605, <a href="gemsiii/accurate_scan/">accurate_scan/</a>.<BR>

Glassner, Andrew, 
<B>Anti-Aliasing in Triangular Pixels</B>,
<I>Graphics Gems III</I>, p. 369-373.<BR>

Donovan, Walt, and Van Hook, Tim, 
<B>Direct Outcode Calculation for Faster Clip Testing</B>,
<I>Graphics Gems IV</I>, p. 125-131, code: p. 127-131, <a href="gemsiv/outcode/">outcode/</a>.<BR>

Christensen, Jon, Marks, Joe, and Shieber, Stuart, 
<B>Placing Text Labels on Maps and Diagrams</B>,
<I>Graphics Gems IV</I>, p. 497-504.<BR>

Szirmay-Kalos, L醩zl

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -