Computational Geometry
Adaptive Tessellation
Analytic Surfaces
Basic Vector Calculus and Geometry
BSP Trees
Bucket Sort
Centroid, Circumcenter, Orthocenter Generalized
Cheltons Convex Mesh Algorithm
Clipping in a Linked Simplex Mesh
Cohen-Sutherland Line-Clipping Algorithm
Computational Geometry
Computing a Straight Line in Integers
Constructing an Icosahedron
Convex Polygon Tessellation
Convex Shape Intersection
Convexity and Shape Representation in Algebra
Convex Hull Algorithms
Cylinder and Cylinder Intersection
Delaunay Triangulations
Divide and Conquer
Dual Convex Mesh Algorithm
Grids
Half Space Intersection Tessellation
Half Space Number System
Hard Sphere Collision
Inclusion in a Polygon
Indexed Simplex to Linked Simplex
Intersection Tests
Kinematic Data Structures
Lighting Equation
Linked: Polytopes
Triangles
Mandelbrot's Peano-snowflake curve
Marching Triangles, Squares, Cubes, Tetrahedrons
Mazes
Meshes from Point Cloud
Meshes from Shapes
Meshes from Surfaces
Midpoint Line Algorithm
Monotone Polygon
Normal Generation
Occlusion
Patches
Point Ordering from a Hull
Polygon Meshes
Procedural Methods - Language Based Models
Quick Hull
Quick Hull Mesh Generation with Minimization
Scan Line Algorithm
Simplex Meshes with State
Simplex Transversal in a Linked Simplex Mesh
Sorting Algorithms
Splines
Surface Extraction for a Linked Simplex Mesh
Surface Identification, Area and Volume Calculations in a Linked Simplex Mesh
Surface Intersecting Mesh
Sutherland-Hodgman Polygon Clipping Algorithm
Transformations
Triangulating a Monotone Polygon
Turtle Graphics
Building Meshes with Fans
Vectors
Viewpoints
Z-buffer Algorithm
Mesh Point Rebalancing
Indexed Simplexes
Indexed Triangles
Indexed Points
Linked Triangles
Linked Simplex Meshes
Arrays
Triangles: Indexed, Linked
Simplexes: Indexed, Linked
Arrays - primitive data structure,
indexing
Indexed Tetrahedrons