A non-self-intersection Douglas-Peucker algorithm

Brazilian Symposium of Computer Graphic and Image Processing

Volumn 2003-January, Issue , 2003, Pages 60-66

  Wu, S T ^a   Marquez M R G ^a  

^a UNIVERSITY OF CAMPINAS   (Brazil)

Author keywords

Automation; Computer graphics; Computer industry; Data mining; Data visualization; Displays; Feature extraction; Geographic Information Systems; Sampling methods

Indexed keywords

ALGORITHMS; AUTOMATION; COMPUTER GRAPHICS; DATA VISUALIZATION; DISPLAY DEVICES; FEATURE EXTRACTION; GEOGRAPHIC INFORMATION SYSTEMS; IMAGE PROCESSING; INFORMATION SYSTEMS;

COMPUTER INDUSTRY; DOUGLAS-PEUCKER; DOUGLAS-PEUCKER ALGORITHM; LINE SIMPLIFICATION; PERCEPTUAL REPRESENTATIONS; SAMPLING METHOD; SELF-INTERSECTIONS; STAR-SHAPED;

DATA MINING;

EID: 84944449345     PISSN: 15301834     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SIBGRA.2003.1240992     Document Type: Conference Paper

References (16)

1. A.Saalfeld. Topologically consistent line simplification with the Douglas Peucker algorithm. Cartography and Geographic Information Science, 26(1):7-18, 1999.
2. R.M. da Silva and S.-T. Wu. Reconstructing a 3d model from range images using radial flow model. In IEEE Proceedings Sibgrapi 98, pages 54-61, 1998.
3. Jonathan de Halleux. An C++ implementation of Douglas-Peucker line approximation algorithm. http://www.codeproject.com/useritems/dphull.asp.
4. D. Douglas and T. Peucker. Algorithms for the reduction of the number of points required for represent a digitzed line or its caricature. Canadian Cartographer, 10(2):112-122, 1973.
5. Eric Haines. Point in polygon strategies. Graphics Gems IV, pages 24-46, 1994.
6. John Hershberger and Jack Snoeyink. Speeding up the Douglas-Peucker line-simplification algorithm. In Proceedings 5th Symp on Data Handling, pages 134-143, 1992.
7. G. F. Jenks. Lines, computers and human frailties. In Annals of the Association of American Geographers, pages 1-10, 1981.
8. T. Lang. Rules for robot draughtsmen. Geographical Magazine, 22:50-51, 1969.
9. M.Johnston, C.D. Scott, and R. Gibb. Problems arising from a simple GIS generalisation algorithm. In Proceedings of the Eleventh Annual Colloquium of the Spatial Information Research Centre, pages 191-200, Dunedin, New Zealand, 1999.
10. U. Ramer. An iterative procedure for he polygonal approximation of plane curves. Computer Graphics and Image Processing, 1:224-256, 1972.
11. K. Reumann and A.P.M. Witkam. Optimizing curve segmentation in computer graphics. In Proceedings of the International Computing Symposium, pages 467-472, 1974.
12. Range images. http://sampl.eng.ohio-state.edu/sampl/data/3DDB/RID.
13. Dan Sunday. Geometric algorithms. http://geometryalgorithms.com/Archive/algorithm\-0205/algorithm\-0205.h%tm.
14. W.R. Tobler. An experiment in the computer generalization of map. Technical report, Office of Naval Research, Geography Branch, 1964.
15. M. Visvalingam and J.D. Whyatt. Line generalisation by repeated elimination of points. Cartographic Journal, 30(1):46-51, 1993.
16. Z. Zhao and A. Saalfeld. Linear-time sleeve-fitting polyline simplification algorithms. In Proceedings of AutoCarto 13, pages 214-223, 1997.