A computer science perspective on the bendsimplification algorithm

Visvalingam, M.; Herbert, S.

Abstract

The primary aim of this study was to evaluate whether the use of bends provides a better basis than point elimination for research on line structuring. These investigations were undertaken using Arc/Info 7.1.1. Comparative experimental results suggest that the algorithm may not be as widely applicable as the much simpler geometric filters, such as the Douglas-Peucker or Visvalingam algorithms. The paper therefore provides a brief review of these three algorithms. A more detailed conceptual and empirical evaluation of the bendsimplification system follows, highlighting some problems with implementing the system in Arc/Info. The paper then questions the value of over-coupling model- and image-oriented generalization processes within the black-box bendsimplification system. It suggests the type of parameters which could enhance the utility and usability of the Bendsimplify option within the Arc/Info (and perhaps also within the ArcView) environment and provides some pointers for further research. With respect to the main aim of the research, the evidence suggests that bendsimplification is less useful for line segmentation than Visvalingam's algorithm. Further research is needed to assess the value of the iterative bend elimination operator within bendsimplification.

Citation

Visvalingam, M., & Herbert, S. (1999). A computer science perspective on the bendsimplification algorithm. Cartography and Geographic Information Science, 26(4), 253-270. https://doi.org/10.1559/152304099782294177

• Journal Article Type: Article
• Online Publication Date: Mar 14, 2013
• Publication Date: 1999-01
• Deposit Date: Aug 10, 2016
• Journal: Cartography and geographic information systems
• Print ISSN: 1523-0406
• Publisher: Taylor and Francis
• Peer Reviewed: Peer Reviewed
• Volume: 26
• Issue: 4
• Pages: 253-270
• DOI: https://doi.org/10.1559/152304099782294177
• Keywords: Line generalization, Bendsimplification, Arc/Info, Visvalingam's algorithm
• Public URL: https://hull-repository.worktribe.com/output/442128
• Publisher URL: http://www.tandfonline.com/doi/abs/10.1559/152304099782294177
• Contract Date: Aug 10, 2016