Efficient algorithms for orthogonal polygon approximation

In applications such as VLSI floorplanning, pattern recognition and image processing, an important problem is to compress the data needed to represent certain geometric structures subject to some approximation criteria so that manipulating these structures would not require excessive amount of compu...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:1996 IEEE International Symposium on Circuits and Systems Ročník 4; s. 779 - 782 vol.4
Hlavní autoři: Chen, D.Z., Hu, X., Blatner, P.J.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 1996
Témata:
Application software
Approximation algorithms
Computer science
Design automation
Image coding
Image processing
Image recognition
Minimization methods
Physics computing
Very large scale integration
ISBN:9780780330733, 0780330730
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In applications such as VLSI floorplanning, pattern recognition and image processing, an important problem is to compress the data needed to represent certain geometric structures subject to some approximation criteria so that manipulating these structures would not require excessive amount of computing resources. Techniques based on polygonal approximation have been used increasingly in such applications. In this paper, we present two efficient yet very simple algorithms to solve the convex orthogonal polygon approximation problem. One of our algorithms takes O(n/sup 3/ log k//spl radic/(log n)) time and O(n/sup 2/) space. The other algorithm only takes O(n) space with the time complexity of O(n/sup 3/k). The previously best known algorithm solves the same problem using O(n/sup 5/) time and O(n/sup 4/) space. In addition to the improvement in both time and space complexities, our algorithms are also simple to understand and simple to implement. Our techniques and observations are quite general in their own right and may be applicable to other problems.
ISBN:9780780330733
0780330730
DOI:10.1109/ISCAS.1996.542185