MIT6_042JS10_lec20

# MIT6_042JS10_lec20 - Planar Graphs Mathematics for Computer...

This preview shows pages 1–3. Sign up to view the full content.

1 Albert R Meyer, March 19, 2010 lec 7F.1 Mathematics for Computer Science MIT 6.042J/18.062J Planar Graphs Albert R Meyer, March 19, 2010 lec 7F.2 Planar Graphs Albert R Meyer, March 19, 2010 lec 7F.3 Planar Graphs A graph is planar if there is a way to draw it in the plane without edges crossing. Albert R Meyer, March 19, 2010 lec 7F.4 4 Continuous Faces here 4 1 2 3 continuous face ::=connected region the outside face Albert R Meyer, March 19, 2010 lec 7F.5 a b c d Region Boundaries Albert R Meyer, March 19, 2010 lec 7F.6 a b c d Region Boundaries abca © Source unknown. All rights reserved. This content is excluded from our Creative Commons license. For more information, see http://ocw.mit.edu/fairuse .

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
2 Albert R Meyer, March 19, 2010 lec 7F.7 a b c d Region Boundaries abda abca Albert R Meyer, March 19, 2010 lec 7F.9 a b c d Region Boundaries abda bcdb abca Albert R Meyer, March 19, 2010 lec 7F.10 a b c d Region Boundaries acda abca abda bcdb Albert R Meyer, March 19, 2010 lec 7F.13 a d b c g f e Region Boundaries: Bridge abcda efge ab ce fg ec da
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 05/27/2011 for the course CS 6.042J taught by Professor Prof.albertr.meyer during the Spring '11 term at MIT.

### Page1 / 7

MIT6_042JS10_lec20 - Planar Graphs Mathematics for Computer...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online