Categories
1 results found in 36 ms.
Page 1 of 1
File: 18-319-fall-2005.zip
This OER is part of OCW: 18.319 Geometric Combinatorics (MIT)
Published under: /Download Course Materials
Share in:
Used by:
Inherited Tag(s):
- mathematics
- discrete geometry
- computational geometry
- convex partitions
- binary space partitions
- art gallery problems
- planar graphs
- pseudo-triangulations
- encompassing graphs
- geometric graphs
- crossing numbers
- extremal graph theory
- gallai-sylvester problems
Similar courses
-
Description:This course offers an introduction to discrete and computational geometry. Emphasis is placed on teaching methods in combinatorial geometry. Many results presented are recent, and include open (as yet unsolved) problems.
-
Description:This course offers an introduction to discrete and computational geometry. Emphasis is placed on teaching methods in combinatorial geometry. Many results presented are recent, and include open (as yet unsolved) problems.
-
Description:This course offers an introduction to discrete and computational geometry. Emphasis is placed on teaching methods in combinatorial geometry. Many results presented are recent, and include open (as yet unsolved) problems.
1 results found.
Page 1 of 1