Digital Geometry

List of Algorithms

2D borders, boundaries, or frontiers

• border tracing, 142

• boundary approximation (“marching squares”), 146

• frontier tracing (frontier grid, incidence grid), 187

3D boundaries or frontiers

• frontier tracing (FILL algorithm), 191

• frontier tracing (Artzy-Herman algorithm), 300–301

• boundary approximation (marching cubes), 301–302

adjacency and connectedness

• FILL for component labeling (adjacency grid), 53

• Rosenfeld-Pfaltz component labeling, 54

• local adjacency (incidence grid), 182

• ordered adjacency procedure (multilevel pictures), 183

• switch adjacency (multilevel pictures), 39, 249

2D convex hulls

• Graham scan (set of points), 25

• Sklansky algorithm (“visible” simple polygon), 430

•