Efficient generation of simple polygons for characterizing the shape of a set of points in the plane

Authors:
Matt Duckham;Lars Kulik;Mike Worboys;Antony Galton
Affiliations:
Department of Geomatics, University of Melbourne, Victoria 3010, Australia;Department of Computer Science and Software Engineering, University of Melbourne, Victoria 3010, Australia;National Center for Geographic Information and Analysis, University of Maine, Orono, ME 04469, USA;School of Engineering, Computing and Mathematics, University of Exeter, Exeter EX4 4QF, UK
Venue:
Pattern Recognition
Year:
2008

Citing 13
Cited 16

Triangulating a simple polygon in linear time

Discrete & Computational Geometry
A novel approach to computation of the shape of a dot pattern and extraction of its perceptual border

Computer Vision and Image Understanding
r-regular shape reconstruction from unorganized points

Computational Geometry: Theory and Applications - special issue on applied computational geometry
Functional specification and prototyping with oriented combinatorial maps

Computational Geometry: Theory and Applications
The power crust

Proceedings of the sixth ACM symposium on Solid modeling and applications
Computational Geometry in C

Computational Geometry in C
Geographic Data Mining and Knowledge Discovery

Geographic Data Mining and Knowledge Discovery
Non-convex onion-peeling using a shape hull algorithm

Pattern Recognition Letters
Monitoring dynamic spatial fields using responsive geosensor networks

Proceedings of the 13th annual ACM international workshop on Geographic information systems
Edge-Based Data Structures for Solid Modeling in Curved-Surface Environments

IEEE Computer Graphics and Applications
Dynamic collectives and their collective dynamics

COSIT'05 Proceedings of the 2005 international conference on Spatial Information Theory
On the shape of a set of points in the plane

IEEE Transactions on Information Theory
On the convex layers of a planar set

IEEE Transactions on Information Theory

Pareto-Optimality of Cognitively Preferred Polygonal Hulls for Dot Patterns

Proceedings of the international conference on Spatial Cognition VI: Learning, Reasoning, and Talking about Space
Approximating the Behaviours of Physarum polycephalum for the Construction and Minimisation of Synthetic Transport Networks

UC '09 Proceedings of the 8th International Conference on Unconventional Computation
A taxonomy of collective phenomena

Applied Ontology
Assigning footprints to dot sets: an analytical survey

COSIT'09 Proceedings of the 9th international conference on Spatial information theory
A polygon-based methodology for mining related spatial datasets

Proceedings of the 1st ACM SIGSPATIAL International Workshop on Data Mining for Geoinformatics
Automatic recognition of 2D shapes from a set of points

ICIAR'11 Proceedings of the 8th international conference on Image analysis and recognition - Volume Part I
Mining qualitative patterns in spatial cluster analysis

Expert Systems with Applications: An International Journal
Delineating imprecise regions via shortest-path graphs

Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Learning boundaries of vague places from noisy annotations

Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Preserving geometric properties in reconstructing regions from internal and nearby points

Computational Geometry: Theory and Applications
Minimum area enclosure and alpha hull of a set of freeform planar closed curves

Computer-Aided Design
Footprint generation using fuzzy-neighborhood clustering

Geoinformatica
Parameterization of point-cloud freeform surfaces using adaptive sequential learning RBFnetworks

Pattern Recognition
Recursive voids for identifying a nonconvex boundary of a set of points in the plane

Pattern Recognition
A Framework for Discriminative Polygonal Place Scoping

Proceedings of The First ACM SIGSPATIAL International Workshop on Computational Models of Place
Computation of the travelling salesman problem by a shrinking blob

Natural Computing: an international journal

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper presents a simple, flexible, and efficient algorithm for constructing a possibly non-convex, simple polygon that characterizes the shape of a set of input points in the plane, termed a characteristic shape. The algorithm is based on the Delaunay triangulation of the points. The shape produced by the algorithm is controlled by a single normalized parameter, which can be used to generate a finite, totally ordered family of related characteristic shapes, varying between the convex hull at one extreme and a uniquely defined shape with minimum area. An optimal O(nlogn) algorithm for computing the shapes is presented. Characteristic shapes possess a number of desirable properties, and the paper includes an empirical investigation of the shapes produced by the algorithm. This investigation provides experimental evidence that with appropriate parameterization the algorithm is able to accurately characterize the shape of a wide range of different point distributions and densities. The experiments detail the effects of changing parameter values and provide an indication of some ''good'' parameter values to use in certain circumstances.