Abstract
In this paper, we consider the minimum Chebyshev ϵ polygonal approximation problem. For this problem, we can use the plane sweep strategy to solve it in O(n 2 ) time.
- Title
- Plane sweep algorithms for the polygonal approximation problems with applications
- Creators - without role
- D.P. Wang - Department of Computer Science , National Tsing-Hwa UniversityN.F. Huang - Department of Computer Science , National Tsing-Hwa UniversityH.S. Chao - Department of Computer Science , National Tsing-Hwa UniversityR.C.T. Lee - Department of Computer Science , National Tsing-Hwa University
- Identifiers
- 9783540575689; 9957775757306774
- Copyright
- © Springer-Verlag Berlin Heidelberg 1993.
- Academic Unit
- Institute of Communications Engineering, College of Electrical Engineering and Computer Science, National Tsing Hua University
- Language
- English
- Resource Type
- Conference paper
- Publication Details
- Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol.762 LNCS, pp.515-522