scholarly journals Archimedean graph designs

2013 ◽  
Vol 313 (11) ◽  
pp. 1138-1149 ◽  
Author(s):  
A.D. Forbes ◽  
T.S. Griggs
Keyword(s):  
2015 ◽  
Vol 15 (3) ◽  
pp. 238-252 ◽  
Author(s):  
Annemarie Quispel ◽  
Alfons Maes ◽  
Joost Schilperoord

We investigated the relationship between familiarity, perceived ease of use, and attractiveness of graph designs in two target groups: experts and laymen in design. In the first study, we presented them with a variety of more or less common graph designs and asked them without any additional task to evaluate their familiarity, attractiveness, and perceived ease of use. They judged the familiarity and ease of use of the graphs similarly, but they differed in their attractiveness judgments. Familiarity and perceived ease of use appeared to predict attractiveness, but stronger for laymen than for designers. Laymen are attracted to designs they perceive as familiar and easy to use. Designers are attracted to designs between familiar and novel. In the second study, we asked designers and laymen to first perform an information retrieval task with the same graphs and then rate their attractiveness. Laymen’s appreciations remained the same, but the designers’ judgments of attractiveness were different from those in study 1. Correlational analyses suggest that their attractiveness judgments after use were affected not by actual usability but by perceived ease of use of the graphs.


2000 ◽  
Vol 16 (1) ◽  
pp. 93-102 ◽  
Author(s):  
H.-D.O.F. Gronau ◽  
R.C. Mullin ◽  
A. Rosa ◽  
P.J. Schellenberg

2009 ◽  
Vol 309 (18) ◽  
pp. 5781-5788
Author(s):  
Peter Adams ◽  
Hayri Ardal ◽  
Ján Maňuch ◽  
Vũ Dình Hòa ◽  
Moshe Rosenfeld ◽  
...  
Keyword(s):  

2000 ◽  
Vol 44 (21) ◽  
pp. 3-439-3-442 ◽  
Author(s):  
Douglas J. Gillan

Research and models of graph reading suggest that the reader's task is an important determinant of the perceptual and cognitive processing components that the reader uses. When people read a pie graph to determine the proportional size of a segment, they apply three processing components: selecting the appropriate mental anchor to which to compare the segment (25%, 50%, or 75%), mentally aligning the anchor to the angular position of the segment around the pie, and mentally adjusting the anchor to match the pie segment size. When a pie graph reader faces a different task, e.g., estimating the ratio of two segments or the difference between two segments, does she use the same processing components to estimate the proportions of A and of B (and then divide one estimate into the other) or does she use a more direct method of mentally aligning the two segments to be compared, then mentally overlaying one on the other (for a ratio) or estimating the spatial difference between the pie segments (for a difference). Two experiments supported the Direct models over the Proportion-based models. The component processes of the Direct models suggest that pie graph designs that eliminated the angular difference between segments being compared should improve performance.


1996 ◽  
Vol 51 (3) ◽  
pp. 273-281 ◽  
Author(s):  
W.D. Wallis
Keyword(s):  

1996 ◽  
Vol 156 (1-3) ◽  
pp. 269-275 ◽  
Author(s):  
Donald L. Kreher ◽  
Gordon F. Royle ◽  
W.D. Wallis
Keyword(s):  

2017 ◽  
Vol 340 (7) ◽  
pp. 1598-1611 ◽  
Author(s):  
Anthony D. Forbes ◽  
Terry S. Griggs ◽  
Tamsin J. Forbes
Keyword(s):  

1986 ◽  
Vol 29 (4) ◽  
pp. 385-391 ◽  
Author(s):  
C. J. Colbournt ◽  
R. C. Hamm ◽  
C. C. Lindner ◽  
C. C. Lindner ◽  
C. A. Rodger

AbstractA general embedding technique for graph designs and block designs is developed, which transforms the embedding problem for partial designs with ƛ > 1 into the embedding problem for partial designs with ƛ = 1. Given an embedding technique for n-element partial block designs with ƛ = 1 into block designs with f(n) elements, the transformation produces a technique which embeds an «-element partial design with ƛ > 1 and block size k into a design with at most /(3k-1ƛn2) elements. For graph designs and block designs with k > 3, a finite embedding method results. For triple systems, a quadratic embedding technique is obtained immediately; the best previous result here was exponential. Finally, for partial triple systems, Mendelsohn triple systems, and directed triple systems, these quadratic embeddings are improved to linear using a colouring technique.


Sign in / Sign up

Export Citation Format

Share Document