Skip to main content
SpringerLink
Log in

Fast and Simple Approach for Polygon Schematization

  • Conference paper
Computational Science and Its Applications – ICCSA 2012 (ICCSA 2012)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7333))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. boost, Peer-reviewed portable c++ source libraries, http://www.boost.org

  2. cgal, Computational Geometry Algorithms Library, http://www.cgal.org

  3. Agarwal, P.K., Varadarajan, K.R.: Efficient algorithms for approximating polygonal chains. Discrete & Computational Geometry 23(2), 273–291 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  4. Bose, P., Cabello, S., Cheong, O., Gudmundsson, J., van Kreveld, M.J., Speckmann, B.: Area-preserving approximations of polygonal paths. J. Discrete Algorithms 4(4), 554–566 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  5. Bresenham, J.E.: Algorithm for computer control of a digital plotter. IBM Systems Journal 4(1), 25–30 (1965)

    Article  Google Scholar 

  6. Chen, D.Z., Daescu, O.: Space-efficient algorithms for approximating polygonal curves in two-dimensional space. Int. J. Comput. Geometry Appl. 13(2), 95–111 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  7. Chen, D.Z., Daescu, O., Hershberger, J., Kogge, P.M., Mi, N., Snoeyink, J.: Polygonal path simplification with angle constraints. Comput. Geom. 32(3), 173–187 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  8. Cicerone, S., Orlandi, A., Archambeault, B., Connor, S., Fan, J., Drewniak, J.L.: Cavities’ identification algorithm for power integrity analysis of complex boards. In: 20th Int. Zurich Symposium on Electromagnetic Compatibility (EMC-Zurich 2009), pp. 253–256. IEEE Press (2009)

    Google Scholar 

  9. Daescu, O.: New results on path approximation. Algorithmica 38(1), 131–143 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  10. Delling, D., Gemsa, A., Nöllenburg, M., Pajor, T.: Path Schematization for Route Sketches. In: Kaplan, H. (ed.) SWAT 2010. LNCS, vol. 6139, pp. 285–296. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  11. Demetrescu, C., Finocchi, I., Italiano, G.F.: Algorithm engineering, algorithmics column. Bulletin of the EATCS 79, 48–63 (2003)

    Google Scholar 

  12. Douglas, D.H., Peucker, T.K.: Polygonal path simplification with angle constraints. The Canadian Geographer 10(2), 112–122 (1973)

    Google Scholar 

  13. Gudmundsson, J., Narasimhan, G., Smid, M.H.M.: Distance-preserving approximations of polygonal paths. Comput. Geom. 36(3), 183–196 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  14. Imai, H., Iri, M.: Computational-geometric methods for polygonal approximations of a curve. Computer Vision, Graphics, and Image Processing 36(1), 31–41 (1986)

    Article  Google Scholar 

  15. Kurozumi, Y., Davis, W.A.: Polygonal approximation by the minimax method. Computer Graphics and Image Processing 19, 248–264 (1982)

    Article  MATH  Google Scholar 

  16. Lei, C.T., Techentin, R.W., Gilbert, B.K.: High-frequency characterization of power/ground plane structures. IEEE Trans. Microwave Theory Tech. 47, 562–569 (1999)

    Article  Google Scholar 

  17. Merrick, D., Gudmundsson, J.: Path Simplification for Metro Map Layout. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol. 4372, pp. 258–269. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  18. Müller-Hannemann, M., Schirra, S.: Chapter 1. Foundations of Algorithm Engineering. In: Müller-Hannemann, M., Schirra, S. (eds.) Algorithm Engineering. LNCS, vol. 5971, pp. 1–15. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  19. Na, N., Choi, J., Chun, S., Swaminatham, M., Srinivasan, J.: Modeling and transient Simulation of planes in electronic packages. IEEE Trans. on Advanced Packaging 23(3), 340–352 (2000)

    Article  Google Scholar 

  20. Neyer, G.: Line Simplification with Restricted Orientations. In: Dehne, F., Gupta, A., Sack, J.-R., Tamassia, R. (eds.) WADS 1999. LNCS, vol. 1663, pp. 13–24. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  21. Swaminathan, M., Joungho, K., Novak, I., Libous, J.: Power distribution networks for system-on-package: status and challenges. IEEE Trans. on Advanced Packaging 27(2), 286–300 (2004)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Electrical and Information Engineering, University of L’Aquila, L’Aquila, Italy

    Serafino Cicerone & Matteo Cermignani

Authors
  1. Serafino Cicerone
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Matteo Cermignani
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Laboratory of Urban and Territorial Systems, University of Basilicata, 10, Viale dell’Ateneo Lucano, 85100, Potenza, Italy

    Beniamino Murgante

  2. Department of Mathematics and Computer Science, University of Perugia, Via Vanvitelli 1, 06123, Perugia, Italy

    Osvaldo Gervasi

  3. Department of Cyber Security Science, Federal University of Technology, Gidan Kwano Campus, Minna, Nigeria

    Sanjay Misra

  4. Faculty of Engineering, Department of Electronics Engineering and Telecommunications, State University of Rio de Janeiro, Rua Sao Francisco Xavier, 524, 50. andar, sala 5145-F, Maracana, 20, 550-013, Rio de Janeiro, RJ, Brazil

    Nadia Nedjah

  5. Department of Production and Systems, University of Minho, Campus de Gualtar, 4710-057, Braga, Portugal

    Ana Maria A. C. Rocha

  6. School of Business Systems, Monash University, 3800, Clayton, VIC, Australia

    David Taniar

  7. Department of Intelligent Informatics, Kyushu Sangyo University, 2-3-1 Matsukadai, Higashi-ku, 813-8503, Fukuoka, Japan

    Bernady O. Apduhan

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cicerone, S., Cermignani, M. (2012). Fast and Simple Approach for Polygon Schematization. In: Murgante, B., et al. Computational Science and Its Applications – ICCSA 2012. ICCSA 2012. Lecture Notes in Computer Science, vol 7333. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31125-3_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-31125-3_21

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-31124-6

  • Online ISBN: 978-3-642-31125-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation