Abstract
In several areas of research one encounters the problem of generating an outline that is in some way representative of the spatial distribution of a pattern of dots. Several different algorithms have been published which can generate such outlines, but the detailed evaluation of such algorithms has mostly concentrated on their computational and mathematical properties, while the adequacy of the resulting outlines themselves has been left as a matter of informal human judgment. In this paper it is proposed to investigate the perceptual acceptability of outlines independently of any particular algorithm for generating them, in order to determine objective criteria for evaluating outlines from the full range of possibilities in a way that is conformable to human intuitive assessments. For the sake of definiteness it is assumed that the outline to be produced is a simple closed polygon whose vertices are elements of the given dot pattern, all remaining elements of the dot pattern being in the interior of the polygon. It is hypothesised that to produce a cognitively acceptable outline one should seek simultaneously to minimise both the area and perimeter of the polygon, and that therefore the points in area-perimeter space corresponding to cognitively optimal outlines will lie on or close to the Pareto front. A small pilot study was conducted, the results of which lend strong support to the hypothesis. The paper concludes with some suggestions for further more detailed investigations.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Edelsbrunner, H., Kirkpatrick, D.G., Seidel, R.: On the shape of a set of points in the plane. IEEE Transactions on Information Theory IT-29(4), 551–559 (1983)
Garai, G., Chaudhuri, B.B.: A split and merge procedure for polygonal border detection of dot pattern. Image and Vision Computing 17, 75–82 (1999)
Melkemi, M., Djebali, M.: Computing the shape of a planar points set. Pattern Recognition 33, 1423–1436 (2000)
Chaudhuri, A.R., Chaudhuri, B.B., Parui, S.K.: A novel approach to computation of the shape of a dot pattern and extraction of its perceptual border. Computer Vision and Image Understanding 68(3), 257–275 (1997)
Galton, A.P., Duckham, M.: What is the region occupied by a set of points? In: Raubal, M., Miller, H.J., Frank, A.U., Goodchild, M.F. (eds.) Geographic Information Science: Proceedings of the 4th International Conference, GIScience 2006, pp. 81–98. Springer, Heidelberg (2006)
Moreira, A., Santos, M.: Concave hull: a k-nearest neighbours approach for the computation of the region occupied by a set of points. In: Proceedings of the 2nd International Conference on Computer Graphics Theory and Applications (GRAPP 2007), Barcelona, Spain, March 8-11 (2007)
Alani, H., Jones, C.B., Tudhope, D.: Voronoi-based region approximation for geographical information retrieval with gazetteers. International Journal of Geographical Information Science 15(4), 287–306 (2001)
Arampatzis, A., van Kreveld, M., Reinbacher, I., Jones, C.B., Vaid, S., Clough, P., Joho, H., Sanderson, M.: Web-based delineation of imprecise regions. Computers, Environment and Urban Systems 30, 436–459 (2006)
Galton, A.P.: Dynamic collectives and their collective dynamics. In: Mark, D.M., Cohn, A.G. (eds.) Spatial Information Theory. Springer, Heidelberg (2005)
Duckham, M., Kulik, L., Worboys, M., Galton, A.: Efficient generation of simple polygons for characterizing the shape of a set of points in the plane. Pattern Recognition (March 2008) (in press) (Accepted for publication)
Deb, K.: Multi-objective Optimization Using Evolutionary Algorithms. John Wiley, Chichester (2001)
Amenta, N., Choi, S., Kolluri, R.: The power crust. In: Sixth ACM Symposium on Solid Modeling and Applications, pp. 249–260 (2001)
Amenta, N., Choi, S., Kolluri, R.: The power crust, unions of balls, and the medial axis transform. Computational Geometry: Theory and Applications 19(2-3), 127–153 (2001)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Galton, A. (2008). Pareto-Optimality of Cognitively Preferred Polygonal Hulls for Dot Patterns. In: Freksa, C., Newcombe, N.S., Gärdenfors, P., Wölfl, S. (eds) Spatial Cognition VI. Learning, Reasoning, and Talking about Space. Spatial Cognition 2008. Lecture Notes in Computer Science(), vol 5248. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87601-4_29
Download citation
DOI: https://doi.org/10.1007/978-3-540-87601-4_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-87600-7
Online ISBN: 978-3-540-87601-4
eBook Packages: Computer ScienceComputer Science (R0)