Efficient algorithms for orthogonal polygon approximation

Proceedings - IEEE International Symposium on Circuits and Systems

Volumn 4, Issue , 1996, Pages 779-782

  Chen, Danny Z ^a   Hu, Xiaobo ^a   Blatner, Peter J ^a  

^a UNIVERSITY OF NOTRE DAME   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; DATA COMPRESSION; ERRORS; GRAPH THEORY; IMAGE PROCESSING; INTEGRATED CIRCUIT LAYOUT; MATHEMATICAL MODELS; PATTERN RECOGNITION; PROBLEM SOLVING; VLSI CIRCUITS;

CONVEX ORTHOGONAL POLYGON APPROXIMATION; GENERALIZED SHORTEST PATH; POLYGONS; SPACE COMPLEXITY; TIME COMPLEXITY; VLSI FLOORPLANNING;

ALGORITHMS;

EID: 0029717720     PISSN: 02714310     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (10)