Re: Only #13?

On Sun, 4 Oct 2009 21:35:21 +0000 (UTC), Mel <melbella@xxxxxxx> wrote:

They jumped from present to past quite a bit, with not very good
transitions in-between. Even for someone able to see what was going on,
it felt disjointed. And some of the angles didn't really show me what
the characters kept telling me they were seeing, especially regarding
the shuttle venting atmosphere.

Wasn't it supposed to feel that way? One of those things where they
cut between the characters' present and past and the audience
gradually catches on to the pattern . . .

--
Josh

"Any intelligent fool can make things bigger, more complex and more violent. It
takes a touch of genius and a lot of courage to move in the opposite direction"

- Albert Einstein.

.

Relevant Pages

  • Re: Preview of WWE Rpg
    ... This is what I felt was always missing from wrestling video games ... : characters ... with angles and story arcs. ...
    (rec.sport.pro-wrestling)
  • Re: Wikipedia logo katakana error.
    ... The angles between the first character and ... I'd considered that perhaps the curvature was misleading me, ... curvature does not distort the other characters in a way that would suggest ...
    (sci.lang.japan)
  • Re: A restricted case of graph coloring, is this a known problem?
    ... Now, as I recall, general graph coloring is np-complete. ... For example, if the machine has transitions on the range a-f, we might ... represent those characters by 1, then we might represent the range 0-9 ... one simply applies the coloring algorithm to it and ...
    (comp.theory)
  • A restricted case of graph coloring, is this a known problem?
    ... Now, as I recall, general graph coloring is np-complete. ... in the DFA by remapping input characters (using the translation ... For example, if the machine has transitions on the range a-f, we might ... represent those characters by 1, then we might represent the range 0-9 ...
    (comp.theory)
  • Re: A restricted case of graph coloring, is this a known problem?
    ... Now, as I recall, general graph coloring is np-complete. ... in the DFA by remapping input characters (using the translation ... For example, if the machine has transitions on the range a-f, we might ... represent those characters by 1, then we might represent the range 0-9 ...
    (comp.theory)
Loading