![]()
|
|
This research was designed for
two reasons: firstly, to involve anyone with an interest in
cartographic visualisation to participate in eliciting cartographic
knowledge and to provide them with the opportunity to contribute
their practical knowledge and opinions; and thereby, secondly, to
inform the design of algorithms for line generalisation. In the
past, there has been some resistance to such mining and codification
of expert knowledge. However, many cartographers now welcome highly
interactive computer graphics, computer mapping and virtual reality
systems as providing them with new opportunities for launching
cartography into a new creative age (Collinson, 1997). There is thus
a growing willingness to collaborate in projects that could lead to
better cartographic software. Most algorithms for line
generalisation are based on relatively simple geometric reasoning. The
widely used Douglas-Peucker algorithm (Douglas and Peucker, 1973)
selects the points, which are furthest from a projected line. More
recently, Visvalingam and Whyatt (1993) showed that better results
could be achieved through Visvalingam’s iterative elimination of
triangular geometric features, based on the measured significance of
the point at the apex of the triangle. They found that the best
measure for 2D lines, such as coastlines, is the area that is lost
when a point is dropped. Wang (1996) and Wang and Muller (1998)
proposed a more complex geometric process for simplifying bends (i.e.
concave or convex sections of lines). This included the context
dependent amalgamation of two neighbouring bends, exaggeration of
isolated bends and iterative bend elimination using a shape-weighted
area tolerance. Visvalingam and Herbert (I998) demonstrated that such
complex algorithms do not always produce the intended effect. Indeed,
the ArcInfo 7.1.1 implementation produces quite unacceptable results.
Moreover, as Wang and Muller noted, bend simplification was designed
to operate on simple bends and not on complex curves consisting of
features within features. Thus, only cursory reference is made to the
results from Wang’s bendsimplify algorithm, investigated more fully
elsewhere (Visvalingam and Herbert, 1998). |

|
Visvalingam and Brown (I998) and
Visvalingam and Herbert (1998) deconstructed pre-fractals or teragons
into decogons. Mandelbrot (1987) coined the terms, pre-fractals and
teragons, to refer to specific generations of a fractal curve.
Visvalingam (1996) used the word decogon to refer to deconstructed
patterns, which had no intrinsic meaning. The exercises presented here
force cartographers to engage in typification and abstraction of the
teragons since there is hardly any unnecessary geometric detail present
at these low levels of fractal generation for minimal simplification.
Visvalingam and Brown's decogons (1998) drew attention to the complex
symmetry of the first generation quadric Koch curve, shown in Figure 1,
produced by the repeated application of a generator pattern (in bold) to
the four edges of a square initiator. Visvalingam and Brown (1998) noted
four levels of symmetry, namely : • the 4-fold rotational symmetry around the central axis of rotation (symmetry 1). For example, the four partition planes, which originate from this centre and which pass through the four starting points, divide the curve into its repeating components. • the 2-fold rotational symmetry of the generator around its central point, which is otherwise redundant in defining the generator’s shape (symmetry 2). • a further 2-fold rotational symmetry, creating a Z-pattern, in each half of the generator (symmetry 3) • the bilateral mirror symmetry in sections of the curve which give rise to its rectilinear shape (symmetry 4) The deconstruction of different generations of teragons indicated the types of symmetries that tend to be preserved by different line generalisation algorithms. Visvalingam’s algorithm with the area metric appears to best preserve the symmetry of the teragons. Nevertheless, the range of decogons that could be obtained from even simple teragons was quite large and unexpected. The research, reported here, investigated whether cartographers would tend to deconstruct the lines in a more consistent way. Figure 2 classifies the patterns abstracted by algorithms and by people, and provides an index to Figures 3 to 7. |

|
3. From algorithmic to human deconstruction of the teragonss Different deconstructors impose a different structure on even relatively simple lines. The rows in Figure 3 list the various algorithmic deconstructors and show the series of decogons output by each. To facilitate comparison, all the decogons in a given column have the same number of points. Only a couple of line filtering algorithms was investigated; Fourier and wavelet analyses, which were not included, are likely to produce other patterns. Wang’s (1996) bendsimplify algorithm only extracted the final square initiator shown in the fourth row from the bottom in Figure 3; it used 11 points for depicting a square (Visvalingam and Herbert, 1998). Although all these decogons are equally plausible, the purpose of the research was to ascertain whether cartographers would tend to agree on particular decogons or whether they would also output quite dissimilar decogons. It was hoped that the artificial exercise of having to generalise a meaningless geometric pattern would a) provide some insights into the cartographer’s cognitive processing of these lines, and b) inform further research into digital line segmentation, structuring and generalisation. |

|
4. The exercises and method of data collection and analysis
Appendix 1 provides a listing of the exercises set.
Exercise 1 requires the subject to select 12 out of the 32 points
defining the teragon. Similarly, in Exercise 2, they
were expected to select 20 to 40 points from the 250-point curve. The
exercise is based on that designed by the psychologist Attneave (1954),
which was also used by cartographers, such as Marino (1979), White
(1983) and several others since then. In this particular set of
experiments, sample numbers were specified to enable the participants to
get a feel for the required scale of abstraction. It was hoped that
having done so, they would then be able to express what they felt was
the appropriate solution for that scale in the second part of each
exercise.
Everyone at the meeting attempted the exercise. Some said that they were
too embarrassed with the results to hand them in. Some of the comments
made by cartographers at Reading are worth noting. Firstly, and most
importantly, they felt that the exercise was far too artificial and that
it did not relate to how cartographers worked on lines. Some said that
they went dizzy parsing the line forwards and backwards, checking the
number of points. In comparison to the length of source lines and the
number of points to be selected in the exercises undertaken by Marino
(1979) and White (1983), Exercise 1 was not at all onerous. Even so,
this suggests that the results presented here (and possibly those
presented by other authors) may be partial and that some types of
cognitive processing of lines (in the non-returns) are perhaps not being
detected. |


TABLE 1 : Frequency of different patterns produced for Exercise 1
|
6. Initial Observations and Comments on Exercise 1 The results from Reading are classified and presented in Figures 4 to 7. Some of the figures have been re-drawn by the author where the originals were either too untidy or where the scanned image was not clear. Table 1 shows the number of times a figure of a particular type was produced. In classifying the results, output with mixed patterns have been assigned where justifiable to the class which it most resembled since the aim of the exercise is to study the types of patterns rather than individual patterns per se. Not all subjects gave reasons for why they had chosen a particular pattern, so again the reasons suggested in this paper should be treated as anecdotal even if plausible. All, except one person, attempted to retain the 4-fold rotational symmetry. In general, the figure was being perceived as a whole and the original partition planes were largely ignored. In 10 out 50 figures, subjects appeared to be attempting to use the four parts to explore different patterns. Figure 4a is a good example of such varied exploration. Figure 4b shows a leaning towards a convex rather than concave shape but there were an equal number of people drawing concave shapes. Figure 4c shows a drift towards wings. Figure 4d, shows the exploration of different wing shapes. |


|
Nineteen (of the 56 figures) consisted of rectilinear patterns (Figure
5). The only figure to show a deliberate directional bias was Figure 5f
- this orientational bias could be due to the distorted aspect ratio on
the faxed figures on which they were originally drawn. Fourteen of the
19 figures corresponded to Figure 5a. Nearly all cartographers, who drew
this pattern, produced it during the exploratory phase; only one
cartographer produced this as the final rendition. The following reasons
were presented in its favour: |

|
All except one person who started with the offset cross (Figure 5a), then chose the wing and petal shapes shown in Figure 6; 21 of the 56 figures were of this type. The subjects stated that they deliberately chose to discount the rectangular shape since the winged shapes were more useful for indicating the main and sub-branches in the structure. Cartographers were clearly aware that this structure could be shown using different shaped wings (e.g. exploration of them in Figure 4d as noted earlier). In their final renditions, the cartographers tended to produce straight edged wings, while the students tended to prefer curvy petal-shapes. But, 12 of the 21 figures used the midpoints on edges, instead of the corner points, in the straight edged and curvy shapes. The cartographers indicated a preference for figures which applied the give and take rule (as in Figure 6a, 6e and 6f). Five students produced the pattern in Figure 6g, which was more concerned with showing the overall shape and extent of the 4-petalled shape, perhaps for display at smaller scale. The shapes In Figure 7 also appear to be more concerned with showing the overall extent of the figure. Here again, opinion was divided between the use of convex and concave forms. Of the 14 shapes in this class, 9 were broadly convex. However, the final preference was for concave figures. One of those who produced the concave form in Figure 7c said that she had attempted to balance the give and take and then adjust the shape as in Figure 7d. Note that Figure 7d could be viewed as a stylised version of the offset cross in Figure 5a, in which the minor branch was omitted. Note also, that many of the patterns in Figure 7 use near-redundant points in preference to information rich points located on curvatures in lines. In the final analysis, 15 out of the 28 respondents chose wing and petal shapes for their final rendition. It is interesting that , like the line generalisation algorithms, several respondents decided to sacrifice the level 4 bilateral symmetry in order to preserve the first three levels of symmetry. Some students were also tending to ignore the level 2 symmetry. |


TABLE 2 : Frequency of different patterns produced for Exercise 2
|
7. Observations and Comments on Exercise 2
People had much more difficulty performing a point-based exercise with
the second exercise given the line with 256 points. They tended to
ignore the specified target range of points and focused on the desired
shape instead. Again, the first of the pair, used for exploration,
showed mixed patterns but there was an overwhelming convergence towards
wing and petal shapes in this exercise. Five people, four of whom were
students, abstracted the first generation teragon (Figure 8a) during the
exploratory stage; ten considered rotating the shape (Figures 8b and c).
Interestingly, Figure 8b is one of the decogons abstracted by the
Douglas-Peucker algorithm (Visvalingam and Brown, 1999). One student
produced a generalised winged pattern with just 12 points (Figure 8d),
showing a re-use of a pattern already encountered in Exercise 1. 8. Some Implications of the Observations The results indicate that the art of line generalisation is not entirely intuitive and impenetrable. They suggest some of the types of assumptions and cognitive processes responsible for the variations in output in this case study; for example:
This experiment and the results have confirmed that artificial lines may be segmented and structured in a variety of ways as noted by Visvalingam and Brown (1998). Although the semantics associated with natural lines tend to bias consensus towards specific line structuring schemes, the output of different individuals is known to vary. This suggests that like the algorithms for line generalisation, the algorithms for structuring lines may not be universally applicable either and that there would be a requirement for context-dependent techniques. The results point to some of the issues which need to be taken into account in the design of algorithms and in cartographic training. 9. Insights from a second attempt Some 18 months after
the initial attempt at Reading, members of the BCS Design Group re-did
the exercises. Only nine members returned their work. With the exception
of one person, a computer specialist, all the others were cartographers
by profession. There were 17
participants (excluding the author) at the Glasgow meeting; 7 of these
were professional cartographers and the rest were students. After a
presentation of the material in Secions 1 to 8 of this report, the
questions in Table 3 were used to spur discussion. The participants were
unsure as to whether they consciously manipulated the priorities of
cartographic rules during their intuitive generalisation and abstained
on Q14. Indeed, practising cartographers have questioned the value of
rules and guidelines in design (Collinson, 1997). The extracts from
individual responses indicate that several considerations were being
consciously evaluated and balanced. Although, this experiment was not
successful in extracting a statement of priorities, there is clear
indication that many cartographers consciously apply the give-and-take
rule during the evaluation phase, even if not during the construction
phase (Q5 and individual responses). The output of students and their
unwillingness to vote on some questions, such as Q5, indicate that the
principle of using give-and-take is not in-born and intuitive but that
it is acquired through training and/or experience. The students also
abstained from Q9 and did not fully understand what figure/ground switch
alluded to, suggesting that this is also learnt, but they did feel that
it would be easier to maintain a stable view of the figure if it had
been area-filled. Both cartographers and students showed that they
tended to rely on proven strategies (Q13), and evidence indicates that
give-and-take is regarded as a reliable technique. |

|
In this collaborative research, undertaken by the BCS Design Group, participants were encouraged to deconstruct (produce meaningless forms) which best represented the patterns, represented by the two simulated lines. Line generalisation algorithms can generate a wide variety of patterns given the same lines. The initial aim of the research was to discover whether cartographers would produce more consistent deconstructions. The research was open-ended and exploratory and was not hypothesis driven. The results show how the manual deconstruction of lines can be even more variable. The observations may be no more than anecdotal since the sample size is limited. Nevertheless, they are interesting and provide ideas for further research. These observations suggest the following tentative conclusions (the text in parenthesis provides the type of information on which specific conjectures are based). 1. Cartographic training appears to be fostering :
2. Potential distortions arising from a perceptual tendency :
3. Some potential inhibitions to creative cartographic visualisation:
When these results were shown to
participants some two years later, they were surprised a) at their
initial subconscious behaviour and subsequent change of mind, and b) at
the need to monitor subconscious perception-induced behaviour and
consciously apply visual logic based on common sense and cartographic
precepts. This shows the value of adopting a variety of techniques for
knowledge elicitation, such as introspection and thinking aloud on
paper, individual retrospection, peer review and dialogues on the
psychological and 'cultural' origins of their overt behaviour. These
individuals were also interested in the way some of the others had
approached the exercises and amazed at just how much even this small set
of results revealed about their own inner cognition. This experiment
shows that the art of generalisation is not entirely intuitive and
inscrutable.
ACKNOWLEDGEMENTS |
|
Attneave F(1954) “Some informational aspects of visual perception”, Psychological Review 61 (3) 183 - 193. Buttenfield, B P and McMaster, R B (1991, eds.) Map Generalization: making rules for knowledge representation, Longman, UK Collinson, A (1997) “Virtual Worlds”, The Cartographic J 34 (2) 117 - 124 Douglas, D H and Peucker, T K (1973) “Algorithms for the reduction of the number of points required to represent a digitised line or its caricature”, The Canadian Cartographer 10 (2), 112 - 122 Gregory , R L (1970) The Inteligent Eye, Weidenfield & Nicolson, London Hoffman, D D and Richards, W A (1982) “Parts for Recognition”, Cognition 18, 65 - 96. Mandelbrot, B (1983) The Fractal Geometry of Nature, W.H. Freeman, New York, 3rd edition. Marino, J S (1979) “Identification of characteristic points along naturally occurring lines : an empirical study”, Canadian cartographer 16 (1) 70 - 80 McMaster, R B (1987) “Automated line generalisation”, cartographica 24 (2) 74 - 111 Plazanet, C (1995)”Measurement, characterization and classification for line generalization”, Proceedings of AutoCarto 12, Bethesda, Md., 59-68 USDMC - The Upside Down map Company Ltd (1998) Upside Down Maps, ISBN: 0 952930412 Visvalingam, M (1996) “Approximation, generalisation and deconstruction of planar curves”, Cartographic Information Systems Research Group Discussion Paper 14, University of Hull, 12 pp Visvalingam, M (1998) “Sources of variability in cartographers’ deconstruction of fractals”, Cartographic Information Systems Research Group Discussion Paper 17, University of Hull, 22 pp Visvalingam, M and Brown, C I (1999) “The Deconstruction of Teragons into Decogons”, Computers & Graphics 23 (1), in press Visvalingam, M and Herbert, S P (1998) “A Computer Science perspective on the Bendsimplify algorithm”, Cartographic Information Systems Research Group Discussion Paper 16, University of Hull Visvalingam, M and Whyatt, J D (1990) “The Douglas-Peucker algorithm for line simplification : re-evaluation through visualisation”, Computer Graphics Forum 9 (3), 213 - 228 Visvalingam, M and Whyatt, J D (1993) “Line generalisation by repeated elimination of points”, The Cartographic Journal 30 (1), 46 - 51 Wang, Z (1996) “Manual versus automated line generalization”, In: Proceedings of GIS/LIS ‘96, Denver, Colorado, 94 - 106. Wang, Z and Muller, J-C. (1998) “Line generalization based on an analysis of shape characteristics”. Cartography and Geographical Information Systems, 25 (1) 3-15. White, E R (1983) “Perceptual evaluation of line generalisaton algorithms”, Unpublished Masters Thesis, University of Oklahoma. |
Appendix 1 Click here for the exercises
| © Dr Mahes Visvalingam, University of Hull, Uploaded April 2006 |
Cartographic Information Systems Research Group, University of Hull