Characterisation and generalisation of cartographic lines using Delaunay triangulation

International Journal of Geographical Information Science

Volumn 16, Issue 8, 2002, Pages 773-794

  Van der Poorten, P M ^a   Jones, Christopher B ^a  

^a CARDIFF UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CARTOGRAPHY; MAP GENERALIZATION; TRIANGULATION;

EID: 0036891777     PISSN: 13658816     EISSN: None     Source Type: Journal    
DOI: 10.1080/13658810210149434     Document Type: Article

References (18)

1. A binary tree representation of curve hierarchical structure based on Gestalt principles
2. Treatment of the cartographic line
3. Topologically correct subdivision simplification using the bandwidth criterion
4. Algorithm for the reduction of the number of points required to represent a digitized line or its caricature
5. Skeletal reconstruction of branching shapes
6. Primal/dual spatial relationships and applications
7. Map generalisation with a triangulated data structure
8. Automated line generalisation
9. Medial axis transformation of a planar shape
10. The removal of spatial conflicts in line generalisation
11. The importance of geometric modelling in linear feature generalisation
12. Topologically consistent line simplification with the Douglas-Peucker algorithm
13. Automatic line generalisation using zero crossings
14. Customisable line generalisation using Delaunay triangulation
15. Line generalisation by repeated elimination of points
16. A computer science perspective on the Bendsimplification algorithm
17. Line generalisation based on analysis of shape characteristics
18. Generalising spatial data and dealing with multiple representations