Fast and simple approach for polygon schematization

Authors:
Serafino Cicerone;Matteo Cermignani
Affiliations:
Dept. of Electrical and Information Engineering, University of L'Aquila, L'Aquila, Italy;Dept. of Electrical and Information Engineering, University of L'Aquila, L'Aquila, Italy
Venue:
ICCSA'12 Proceedings of the 12th international conference on Computational Science and Its Applications - Volume Part I
Year:
2012

Citing 9
Cited 1

Computational-geometric methods for polygonal approximations of a curve

Computer Vision, Graphics, and Image Processing
Line Simplification with Restricted Orientations

WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
New Results on Path Approximation

Algorithmica
Area-preserving approximations of polygonal paths

Journal of Discrete Algorithms
Distance-preserving approximations of polygonal paths

Computational Geometry: Theory and Applications
Polygonal path simplification with angle constraints

Computational Geometry: Theory and Applications
Algorithm for computer control of a digital plotter

IBM Systems Journal
Path simplification for metro map layout

GD'06 Proceedings of the 14th international conference on Graph drawing
Path schematization for route sketches

SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory

Accentuating focus maps via partial schematization

Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The schematization of simple polygons into octilinear polygons is a computational problem arising in the context of electronic CAD systems. In particular, it appears when the generation and propagation of electromagnetic noise into real-world multi-layer PCBs has to be detected. In this paper we provide a fast and simple heuristic for solving such a problem. Experimental evaluations over real-world data show the efficiency and the good performance of the proposed approach.