The aesthetic appeal of minimal structures: judging the attractiveness of solutions to traveling salesperson problems.

Ormerod and Chronicle (1999) reported that optimal solutions to traveling salesperson problems were judged to be aesthetically more pleasing than poorer solutions and that solutions with more convex hull nodes were rated as better figures. To test these conclusions, solution regularity and the number of potential intersections were held constant, whereas solution optimality, the number of internal nodes, and the number of nearest neighbors in each solution were varied factorially. The results did not support the view that the convex hull is an important determinant of figural attractiveness.

Effects of 'local' clutter on human target detection.

In theory, properties of clutter can be defined globally or locally. However, in the literature, the distinction between local and global clutter is arbitrary, where the standard approach of setting the local domain to twice the expected target size, in applying local clutter metrics, is adopted without any justification. This paper addresses this problem and considers the implications for the application of clutter metrics.

The roles of the convex hull and the number of potential intersections in performance on visually presented traveling salesperson problems.

The planar Euclidean version of the traveling salesperson problem requires finding the shortest tour through a two-dimensional array of points. MacGregor and Ormerod (1996) have suggested that people solve such problems by using a global-to-local perceptual organizing process based on the convex hull of the array. We review evidence for and against this idea, before considering an alternative, local-to-global perceptual process, based on the rapid automatic identification of nearest neighbors.

The perception of minimal structures: performance on open and closed versions of visually presented Euclidean travelling salesperson problems.

The planar Euclidean version of the travelling salesperson problem (TSP) requires finding a tour of minimal length through a two-dimensional set of nodes. Despite the computational intractability of the TSP, people can produce rapid, near-optimal solutions to visually presented versions of such problems. To explain this, MacGregor et al (1999, Perception 28 1417-1428) have suggested that people use a global-to-local process, based on a perceptual tendency to organise stimuli into convex figures.