Searching for triangulation : 4 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

6.849 Geometric Folding Algorithms: Linkages, Origami, Polyhedra (MIT) 6.849 Geometric Folding Algorithms: Linkages, Origami, Polyhedra (MIT)

Description

Includes audio/video content: AV lectures. This course focuses on the algorithms for analyzing and designing geometric foldings. Topics include reconfiguration of foldable structures, linkages made from one-dimensional rods connected by hinges, folding two-dimensional paper (origami), and unfolding and folding three-dimensional polyhedra. Applications to architecture, robotics, manufacturing, and biology are also covered in this course. Acknowledgments Thanks to videographers Martin Demaine and Jayson Lynch. Includes audio/video content: AV lectures. This course focuses on the algorithms for analyzing and designing geometric foldings. Topics include reconfiguration of foldable structures, linkages made from one-dimensional rods connected by hinges, folding two-dimensional paper (origami), and unfolding and folding three-dimensional polyhedra. Applications to architecture, robotics, manufacturing, and biology are also covered in this course. Acknowledgments Thanks to videographers Martin Demaine and Jayson Lynch.

Subjects

origami | origami | geometry | geometry | algorithm | algorithm | folding | folding | linkage | linkage | polyhedra | polyhedra | seam | seam | crease pattern | crease pattern | universal molecule | universal molecule | box pleating | box pleating | triangulation | triangulation | vertex | vertex | edge | edge | curved crease | curved crease | rigidity | rigidity | tensegrity | tensegrity | hinged dissection | hinged dissection | unfolding | unfolding | gluing | gluing | platonic solid | platonic solid | refolding | refolding | sculpture | sculpture | paper | paper | 3D chain | 3D chain | design | design

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

6.849 Geometric Folding Algorithms: Linkages, Origami, Polyhedra (MIT)

Description

This course focuses on the algorithms for analyzing and designing geometric foldings. Topics include reconfiguration of foldable structures, linkages made from one-dimensional rods connected by hinges, folding two-dimensional paper (origami), and unfolding and folding three-dimensional polyhedra. Applications to architecture, robotics, manufacturing, and biology are also covered in this course. Acknowledgments Thanks to videographers Martin Demaine and Jayson Lynch.

Subjects

origami | geometry | algorithm | folding | linkage | polyhedra | seam | crease pattern | universal molecule | box pleating | triangulation | vertex | edge | curved crease | rigidity | tensegrity | hinged dissection | unfolding | gluing | platonic solid | refolding | sculpture | paper | 3D chain | design

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