A Comparison of Hyperstructures: Zzstructures, mSpaces, and Polyarchies
A Comparison of Hyperstructures: Zzstructures, mSpaces, and Polyarchies
Hypermedia applications tend to use simple representations for navigation: most commonly, nodes are organized within an unconstrained graph, and users are presented with embedded links or lists of links. Recently, new data structures have emerged which may serve as alternative models for both the organization, and presentation, of hypertextual nodes and links. In this paper, we consider zzstructures, mSpaces, and polyarchies from the perspective of graph theory, and compare these models formally. The novel aspects of this work include: providing a sound, graph-theoretic analysis of zzstructures; the identification of a new class of polyarchies associated with mSpaces; and the comparison and classification of these and other structures within a taxonomy. The taxonomy that results from our comparison allows us to consider, first, what the distinct characteristics of each model are at a fundamental level, and second, what model or attributes of a model may be most appropriate for the design goals of a given hypermedia application. [Award: ACM Special Research Distinction Awarded for Excellent Presentation of Theoretical Concepts]
Connective structures, ZigZag, zzstructures, mSpace, polyarchies, multitrees, graph theory, interaction design, navigation
1 58113 848 2
153-162
McGuffin, Michael J.
9a2b3ccb-ce23-49e9-b787-db364bca8ad0
schraefel, m.c.
ac304659-1692-47f6-b892-15113b8c929f
2004
McGuffin, Michael J.
9a2b3ccb-ce23-49e9-b787-db364bca8ad0
schraefel, m.c.
ac304659-1692-47f6-b892-15113b8c929f
McGuffin, Michael J. and schraefel, m.c.
(2004)
A Comparison of Hyperstructures: Zzstructures, mSpaces, and Polyarchies.
ACM Conference on Hypertext and Hypermedia, 2004, Santa Cruz, California, United States.
09 - 13 Aug 2004.
.
Record type:
Conference or Workshop Item
(Paper)
Abstract
Hypermedia applications tend to use simple representations for navigation: most commonly, nodes are organized within an unconstrained graph, and users are presented with embedded links or lists of links. Recently, new data structures have emerged which may serve as alternative models for both the organization, and presentation, of hypertextual nodes and links. In this paper, we consider zzstructures, mSpaces, and polyarchies from the perspective of graph theory, and compare these models formally. The novel aspects of this work include: providing a sound, graph-theoretic analysis of zzstructures; the identification of a new class of polyarchies associated with mSpaces; and the comparison and classification of these and other structures within a taxonomy. The taxonomy that results from our comparison allows us to consider, first, what the distinct characteristics of each model are at a fundamental level, and second, what model or attributes of a model may be most appropriate for the design goals of a given hypermedia application. [Award: ACM Special Research Distinction Awarded for Excellent Presentation of Theoretical Concepts]
Text
mSpace_zzStructures.pdf
- Other
More information
Published date: 2004
Additional Information:
Event Dates: August 9-13, 2004
Venue - Dates:
ACM Conference on Hypertext and Hypermedia, 2004, Santa Cruz, California, United States, 2004-08-09 - 2004-08-13
Keywords:
Connective structures, ZigZag, zzstructures, mSpace, polyarchies, multitrees, graph theory, interaction design, navigation
Organisations:
Agents, Interactions & Complexity
Identifiers
Local EPrints ID: 259230
URI: http://eprints.soton.ac.uk/id/eprint/259230
ISBN: 1 58113 848 2
PURE UUID: 504cf8d3-21a4-401f-934e-3ebbdf4e3554
Catalogue record
Date deposited: 25 Aug 2004
Last modified: 15 Mar 2024 03:16
Export record
Contributors
Author:
Michael J. McGuffin
Author:
m.c. schraefel
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics