Searching for encompassing graphs : 2 results found | RSS Feed for this search

18.319 Geometric Combinatorics (MIT) 18.319 Geometric Combinatorics (MIT)

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. 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.

Subjects

discrete geometry | discrete geometry | computational geometry | computational geometry | convex partitions | convex partitions | binary space partitions | binary space partitions | art gallery problems | art gallery problems | Planar graphs | Planar graphs | pseudo-triangulations | pseudo-triangulations | encompassing graphs | encompassing graphs | geometric graphs | geometric graphs | crossing numbers | crossing numbers | extremal graph theory | extremal graph theory | Gallai-Sylvester problems | Gallai-Sylvester problems

License

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htm

Site sourced from

http://ocw.mit.edu/rss/all/mit-allcourses.xml

Attribution

Click to get HTML | Click to get attribution | Click to get URL

All metadata

See all metadata

18.319 Geometric Combinatorics (MIT)

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.

Subjects

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

License

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see https://ocw.mit.edu/terms/index.htm

Site sourced from

https://ocw.mit.edu/rss/all/mit-allcourses.xml

Attribution

Click to get HTML | Click to get attribution | Click to get URL

All metadata

See all metadata