explain xkcd - User contributions [en]

365: Slides

2013-09-22T09:42:14Z

37.128.6.132: /* Explanation */

{{comic
| number = 365
| date = January 2, 2008
| title = Slides
| image = slides.png
| titletext = Did you know they can actually physically throw you out of SIGGRAPH?
}}

==Explanation==
{{incomplete}}
The expression "bear with me for a moment" usually implies that what you are talking about is not random—the connection is to be explained later. This is not the case in the comic: Cueball is showing random slides which have no connection to each other.

The title text refers to {{w|SIGGRAPH}}, an annual computer graphics conference held since 1974, making the joke that people who attend computer graphics conferences are stereotypically not very athletic and therefore unlikely to be able to physically throw someone.

==Transcript==
:Cueball: That chart explained the quantum hall effect. Now, if you'll bear with me a moment, this next graph shows rainfall over the amazon basin...
:If you keep saying "bear with me a moment" people will take a while to figure out that you're just showing them random slides.

{{comic discussion}}
[[Category:Comics featuring Cueball]]
[[Category:Charts]]

365: Slides

2013-09-22T09:41:46Z

37.128.6.132: /* Explanation */ Typographical corrections.

{{comic
| number = 365
| date = January 2, 2008
| title = Slides
| image = slides.png
| titletext = Did you know they can actually physically throw you out of SIGGRAPH?
}}

==Explanation==
{{incomplete}}
The expression "bear with me a for moment" usually implies that what you are talking about is not random—the connection is to be explained later. This is not the case in the comic: Cueball is showing random slides which have no connection to each other.

The title text refers to {{w|SIGGRAPH}}, an annual computer graphics conference held since 1974, making the joke that people who attend computer graphics conferences are stereotypically not very athletic and therefore unlikely to be able to physically throw someone.

==Transcript==
:Cueball: That chart explained the quantum hall effect. Now, if you'll bear with me a moment, this next graph shows rainfall over the amazon basin...
:If you keep saying "bear with me a moment" people will take a while to figure out that you're just showing them random slides.

{{comic discussion}}
[[Category:Comics featuring Cueball]]
[[Category:Charts]]

Talk:230: Hamiltonian

2013-09-20T08:44:56Z

37.128.6.132: Created page with "I don't agree with the title's explanation. IMO the title refers to the fact the "sudden rush of perspective" happens to Cueball also when he is making love, but starts to thi..."

I don't agree with the title's explanation. IMO the title refers to the fact the "sudden rush of perspective" happens to Cueball also when he is making love, but starts to think about the algorithms.

230: Hamiltonian

2013-09-20T08:42:12Z

37.128.6.132: missed word

{{comic
| number = 230
| date = March 2, 2007
| title = Hamiltonian
| image = hamiltonian.png
| titletext = The problem with perspective is that it's bidirectional.
}}

==Explanation==
[[Cueball]], presumably in class, decides that the subject of Hamiltonian circuits in graphs is not important in the larger context of life and love. Later, however, he realizes there is a flaw in the proof presented, while in bed with [[Megan]], and suddenly wants to focus on the mathematics, in a humorous reversal of his position about what is meaningful.

In graph theory, a {{w|Hamiltonian_path|Hamiltonian}} is a traceable path that connects all the vertices (nodes) by passing through each one exactly once (Think connect the dots with rules!). If this is not possible, then it can be said that no Hamiltonian exists for the given set of vertices. A Hamiltonian cycle is a Hamiltonian where the path begins and ends at the same node. The professor is using the graph theory to optimize some algorithm by solving a {{w|Hamiltonian_path_problem|Hamiltonian path problem}}. He meant to say "Hamiltonian Cycle", but instead said only "Hamiltonian Path".

The title text explains that the Hamiltonian Cycle can be solved in two different directions around the cycle.

==Transcript==
:Lecturer: And therefore, based on the existence of a Hamiltonian path, we can prove that the routing algorithm gives the optimal result in all cases.
:Cueball: Oh my God.
:[Close-up of Cueball.]
:(Out of frame): What? What is it?
:Cueball: A sudden rush of perspective. What am I doing here? Life is so much bigger than this!

:[Cueball running out of room.]
:Cueball: I have to go.
:[Cueball enters darkened room, where Megan waits by window.]
:[Cueball and Megan embrace...]

:[...and get into bed.]
:[A heart appears over the supine bodies.]
:Megan: Ohh...
:[Hands ''grip''.]
:Cueball (out of frame): Wait a moment.
:Megan (out of frame): What is it?
:[Silence.]
:Cueball (out of frame): His proof only holds if there's a Hamiltonian <u>cycle</u> as well as a path!
:Megan (out of frame): ...excuse me?
:Cueball (out of frame): Paper, I need some paper.
:Cueball (out of frame): Hey, do you mind if I jot down some notes on your chest?

{{comic discussion}}
[[Category:Comics featuring Cueball]]
[[Category:Comics featuring Megan]]
[[Category:Comics with color]]
[[Category:Sex]]
[[Category:Math]]
[[Category:Romance]]