计算机图形学

基础概念

对比学习（Contrastive Learning）

Convex Hall

1. Sort
2. Color modulation
3. Postman problem

Simple Polygon

Voronoi Diagram

Conical Surface

Medial Axis Transformation (MAT)

Delaunay Trangulation

Geometry Processing

• Downsampling (Compression)
• Upsampling
  • Chaikin's algorithm
  • B-spline

Homework

HW1

实现任一三维求凸包算法

HW2

Criteria	Quadric Error Metric (QEM)	Variational Shape Approximation (VSA)
Primary Goal	Edge-based simplification	Feature-aware segmentation and approximation
Efficiency	Highly efficient, faster simplification	Slower due to iterative clustering
Feature Preservation	Moderate; can miss fine details	High; preserves sharp edges and features
Adaptability	Uniform across the mesh	Adaptive to curvature and local detail
Simplicity	Straightforward, with simple edge collapse	More complex, requires clustering and proxy fitting
Application Use	Real-time rendering, games	CAD models, architectural visualization