226 results found in 4 ms.
Page 1 of 15 next
More OCW like this |
|
Published by: Massachusetts Institute of Technology | Language: English
Published by: Massachusetts Institute of Technology | Language: English
Share in:
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.
Author(s):
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
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
File: pset1.pdf
This OER is part of OCW: 18.319 Geometric Combinatorics (MIT)
Published under: /Assignments
Share in:
OCW Authors:
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
File: pset4.pdf
This OER is part of OCW: 18.319 Geometric Combinatorics (MIT)
Published under: /Assignments
Share in:
OCW Authors:
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
File: pset3.pdf
This OER is part of OCW: 18.319 Geometric Combinatorics (MIT)
Published under: /Assignments
Share in:
OCW Authors:
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
File: pset5.pdf
This OER is part of OCW: 18.319 Geometric Combinatorics (MIT)
Published under: /Assignments
Share in:
OCW Authors:
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
File: pset2.pdf
This OER is part of OCW: 18.319 Geometric Combinatorics (MIT)
Published under: /Assignments
Share in:
OCW Authors:
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
File: pset6.pdf
This OER is part of OCW: 18.319 Geometric Combinatorics (MIT)
Published under: /Assignments
Share in:
OCW Authors:
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
File: ackerman.pdf
This OER is part of OCW: 18.319 Geometric Combinatorics (MIT)
Published under: /Readings
Share in:
OCW Authors:
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
File: pach.pdf
This OER is part of OCW: 18.319 Geometric Combinatorics (MIT)
Published under: /Readings
Share in:
OCW Authors:
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
File: salman.pdf
This OER is part of OCW: 18.319 Geometric Combinatorics (MIT)
Published under: /Projects
Share in:
OCW Authors:
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
File: jingbin.pdf
This OER is part of OCW: 18.319 Geometric Combinatorics (MIT)
Published under: /Projects
Share in:
OCW Authors:
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
File: daniel.pdf
This OER is part of OCW: 18.319 Geometric Combinatorics (MIT)
Published under: /Projects
Share in:
OCW Authors:
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
File: crossdecay_l.pdf
This OER is part of OCW: 18.319 Geometric Combinatorics (MIT)
Published under: /Projects
Share in:
OCW Authors:
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
File: amanda2.pdf
This OER is part of OCW: 18.319 Geometric Combinatorics (MIT)
Published under: /Projects
Share in:
OCW Authors:
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
More OCW like this |
|
Published by: Massachusetts Institute of Technology | Language: English
Published by: Massachusetts Institute of Technology | Language: English
Share in:
This course covers a collection of geometric techniques that apply broadly in modern algorithm design.
Author(s):
Tag(s):
- mathematics
- spectral graph theory
- iterative methods for linear algebra
- convex geometry
- lattices and basis reduction
- lps and sdps for approximating np-hard problems
- graph laplacians
- cheeger inequalities
- fritz john?s theorem
226 results found.
Page 1 of 15 next