Scribd
Upload
78 views29 pages

01 Introduction

This document provides an overview of the CS468 Geometry Processing Algorithms course at Stanford University. The course covers theory and algorithms for efficiently analyzing and manipulating complex 3D models, with hands-on experience implementing algorithms using the OpenMesh API. Students complete programming assignments on surface smoothing, simplification, parameterization, and remeshing by working in pairs. References include a book and course notes on geometric modeling based on polygonal meshes. The document discusses applications of geometry processing in areas such as medical, simulation, games/movies, and architecture. It provides examples of algorithms for acquiring 3D geometry, simplification, compression, parameterization, remeshing, quad remeshing, symmetry detection, and deformation.

Uploaded by

caigui
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
78 views29 pages

01 Introduction

This document provides an overview of the CS468 Geometry Processing Algorithms course at Stanford University. The course covers theory and algorithms for efficiently analyzing and manipulating complex 3D models, with hands-on experience implementing algorithms using the OpenMesh API. Students complete programming assignments on surface smoothing, simplification, parameterization, and remeshing by working in pairs. References include a book and course notes on geometric modeling based on polygonal meshes. The document discusses applications of geometry processing in areas such as medical, simulation, games/movies, and architecture. It provides examples of algorithms for acquiring 3D geometry, simplification, compression, parameterization, remeshing, quad remeshing, symmetry detection, and deformation.

Uploaded by

caigui
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 29

Geometry 

Processing Algorithms

CS468
CS 468
htt // 468.stanford.edu/
http://cs468
http://cs468.stanford.edu/
t f d d /
Objective
• Theory
Theory and algorithms for efficient 
and algorithms for efficient
analysis and manipulation of complex 3D 
models

• Hands‐on experience

2
Requirements
q
Prerequisites:
‐ IIntroduction to Computer Graphics
t d ti t C t G hi
‐ Experience with C++ programming
‐ Background in geometry or computational geometry 
helpful, but not necessary.

Grade (3 units):
‐ Programming exercises
Programming exercises
‐ OpenMesh intro (10%)
‐ Surface smoothing (20%)
‐ Simplification (20%)
Simplification (20%)
‐ Parameterization (25%)
‐ Remeshing (25%)

Work in pairs. Use OpenMesh
ki i O h API
3
References
• Book
“Polygon Mesh Processing”
by Mario Botsch, Leif Kobbelt, Mark Pauly, Pierre Alliez, 
Bruno Levy

• Eurographics 2008 course notes
“Geometric
Geometric Modeling Based on 
Modeling Based on
Polygonal Meshes”
by Mario Botsch, Mark Pauly, Leif Kobbelt, Pierre Alliez, 
Bruno Levy Stephan Bischoff Christian Rössl
Bruno Levy, Stephan Bischoff, Christian Rössl

• More links on web site

4
What is Geometry Processing About?
What is Geometry Processing About?

• Acquiring

• Analyzing

• Manipulating

5
Applications

Medical E‐Commerce Simulation


Engineering Culture

Games & Movies Architecture Architecture


Creating Reverse Engineering 6
A Geometry Processing Pipeline
Low Level Algorithms

7
A Geometry Processing Pipeline
A Geometry Processing Pipeline

8
A Geometry Processing Pipeline
High Level Algorithms

Deformation and editing


Deformation and editing

Extracting shape structure

9
Acquiring 3
Acquiring 3D Geometry
R
Range Scanners
S

10
Acquiring 3
Acquiring 3D Geometry
R
Range Scanners
S

11
Acquiring 3
Acquiring 3D Geometry
Tomography
Mesh Construction

from contours
from contours
from  from point clouds
from point clouds
13
Simplification

20,000 8,000 2,000

Demo
Demo
Applications
Multi‐resolution hierarchies for 
– efficient geometry processing
– level‐of‐detail (LOD)
( ) renderingg

15
Size--Quality Tradeoff
Size

error

size
i

16
Compression

Surface Geometry Connectivity

VRML = 200K,
200K, zipped VRML = 70
70K,
K, compressed = 15
15KK
demo
Parameterization
3D space (x,y,z)
2D parameter domain (u,v)

boundary
boundary 18
Application ‐‐ Texture Mapping
Application  Texture Mapping

19
Remeshing
More Remeshing
More  Remeshingg

demo 21
Quad Remeshing
Quad Remeshing
Quad 

22
Symmetry Detection
Symmetry Detection

23
Deformation
Deformation
e o a o Transfer
a se
Deformation Transfer
Target Source
28
What’ss Next?
What Next?
• Learn about geometry data structures
Learn about geometry data structures

• Go
Go into detail of a few representative 
into detail of a few representative
algorithms

• Code them up!

• Have fun with geometry ☺

29

You might also like