Computational Geometry CAD Kernel Deep Dive - Expanded Projects

Build the geometric core of a CAD system: robust predicates, topology, NURBS, and boolean modeling.

This directory contains expanded guides for each project in the Computational Geometry CAD Kernel Deep Dive curriculum. Each project makes geometric theory tangible and verifiable.


Learning Philosophy

CAD kernels are unforgiving: a single numerical instability can break an entire model. These projects force you to confront precision, robustness, and topology as real engineering constraints.

The Progression

FOUNDATIONS
  P01 Robust Predicate Engine       -> orientation, incircle, precision
  P02 Polygon Clipper               -> planar clipping and inside/outside
  P03 Half-Edge Mesh Library        -> adjacency and topology

CURVES AND SURFACES
  P04 NURBS Curve Evaluator         -> parametric curves
  P05 NURBS Surface Generator       -> parametric surfaces

SOLIDS
  P06 B-Rep Topology Engine          -> faces, edges, shells
  P07 Simple CSG Engine              -> boolean trees
  P08 Mesh Boolean Evaluator         -> robust solid booleans

DESIGN SYSTEMS
  P09 Constrained Sketch Solver      -> constraint solving
  P10 Feature-Based Modeler          -> extrude, revolve, fillet
  P11 STEP File Data Explorer        -> interoperability

Project Index

# Project Difficulty Time Core Concepts
P01 Robust Predicate Engine Intermediate Weekend Robust orientation tests
P02 Sutherland-Hodgman Clipper Intermediate Weekend Polygon clipping
P03 Half-Edge Mesh Library Intermediate 1-2 weeks Topology and adjacency
P04 NURBS Curve Evaluator Intermediate 1-2 weeks Parametric curves
P05 NURBS Surface Generator Advanced 2-3 weeks Parametric surfaces
P06 B-Rep Topology Engine Advanced 2-3 weeks Solid modeling
P07 Simple CSG Engine Advanced 2-3 weeks Boolean trees
P08 Mesh Boolean Evaluator Advanced 3-4 weeks Robust booleans
P09 Constrained Sketch Solver Advanced 2-3 weeks Nonlinear constraints
P10 Feature-Based Modeler Advanced 3-4 weeks Feature operations
P11 STEP File Data Explorer Intermediate Weekend CAD interoperability

Core Concepts Map

Robust Predicates

  • What they are: Reliable orientation and intersection tests
  • Learned in: P01, P02, P08
  • Key insight: Geometric algorithms fail without numeric robustness

Topology Structures

  • What they are: Data structures for adjacency and connectivity
  • Learned in: P03, P06
  • Key insight: Geometry is shape; topology is how pieces connect

Parametric Geometry

  • What they are: Curves and surfaces defined by parameters
  • Learned in: P04, P05
  • Key insight: CAD uses parametric representations, not triangle meshes

Boolean and Feature Modeling

  • What they are: Constructive operations on solids and features
  • Learned in: P07, P08, P10
  • Key insight: Modeling systems are logic engines with geometry

Constraints and Interchange

  • What they are: Solving design rules and exchanging models
  • Learned in: P09, P11
  • Key insight: Real CAD is about correctness and interoperability