- #1

- 2

- 0

## Main Question or Discussion Point

Are there any theorems that say something formal about the fact that any graph is drawable on a 2D surface, and can be mapped to a 2D array of pixels if the pixels are infinitely small?

- I
- Thread starter paizhaulski
- Start date

- #1

- 2

- 0

Are there any theorems that say something formal about the fact that any graph is drawable on a 2D surface, and can be mapped to a 2D array of pixels if the pixels are infinitely small?

- #2

mfb

Mentor

- 34,053

- 9,913

- #3

FactChecker

Science Advisor

Gold Member

- 5,384

- 1,953

- #4

Stephen Tashi

Science Advisor

- 7,017

- 1,237

Look at material about "planar graphs". Not all graphs are planar graphs.Are there any theorems that say something formal about the fact that any graph is drawable on a 2D surface, and can be mapped to a 2D array of pixels if the pixels are infinitely small?

- Replies
- 10

- Views
- 2K

- Last Post

- Replies
- 6

- Views
- 2K

- Last Post

- Replies
- 1

- Views
- 7K

- Replies
- 10

- Views
- 763

- Last Post

- Replies
- 8

- Views
- 684

- Replies
- 1

- Views
- 2K

- Last Post

- Replies
- 12

- Views
- 2K

- Replies
- 5

- Views
- 588

- Last Post

- Replies
- 6

- Views
- 1K

- Last Post

- Replies
- 10

- Views
- 584