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...

Full description

Saved in:
Bibliographic Details
Published in:1996 IEEE International Symposium on Circuits and Systems Vol. 4; pp. 779 - 782 vol.4
Main Authors: Chen, D.Z., Hu, X., Blatner, P.J.
Format: Conference Proceeding
Language:English
Published: IEEE 1996
Subjects:
ISBN:9780780330733, 0780330730
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Be the first to leave a comment!
You must be logged in first