BRIEF Design a way to navigate multiple levels of - - PowerPoint PPT Presentation

brief design a way to navigate multiple levels of inter
SMART_READER_LITE
LIVE PREVIEW

BRIEF Design a way to navigate multiple levels of - - PowerPoint PPT Presentation

BRIEF Design a way to navigate multiple levels of inter-connectedness. Represent the breadth and depth of content, show connections between topics, and enable navigational methods to facilitate organic exploration. The content will exist in


slide-1
SLIDE 1
slide-2
SLIDE 2

BRIEF

slide-3
SLIDE 3

Design a way to navigate multiple levels of inter-connectedness.

Represent the breadth and depth of content, show connections between topics, and enable navigational methods to facilitate organic exploration. The content will exist in many different forms and will address topics that frequently overlap and are deeply inter-connected. Your task is to explore ways of providing access to this level of inter-connectedness.

slide-4
SLIDE 4
slide-5
SLIDE 5
slide-6
SLIDE 6

DEMO

slide-7
SLIDE 7

RESEARCH

slide-8
SLIDE 8

WAYFINDING THEORY FORCE-DIRECTED GRAPH DRAWING MOLECULES GAME DESIGN

FRAMEWORK ORGANISATION INTERACTION INTERFACE

slide-9
SLIDE 9

Vannevar Bush’s “Memex”

Proto-hypertext system that Vannevar Bush described in his 1945 The Atlantic Monthly article "As We May Think".

Kevin Lynch’s Urban Planning Model

Lynch reported that users understood their surroundings in consistent and predictable ways, forming mental maps with five elements: paths, edges, districts, nodes, and landmarks.

Erik Jonsson’s Human Wayfinding Abilities.

Dead reckoning, direction frame, and mental map. Three methods that are directly transferable from physical navigation to digital navigation.

WAYFINDING THEORY

slide-10
SLIDE 10
  • 1. Information Landscape
slide-11
SLIDE 11
  • 2. Nodes (Atoms)
slide-12
SLIDE 12
  • 3. Routes (Connections)
slide-13
SLIDE 13
  • 4. Super-Route (Molecule)
slide-14
SLIDE 14
  • 5. Landmark
slide-15
SLIDE 15

Force-directed graph drawing algorithms are a class of algorithms for drawing graphs in an aesthetically-pleasing way. Their purpose is to position the nodes of a graph in two-dimensional or three-dimensional space, by assigning forces among the set

  • f edges and the set of nodes,

based on their relative positions.

FORCE-DIRECTED GRAPH DRAWING

slide-16
SLIDE 16

MOLECULES

slide-17
SLIDE 17

GAME DESIGN