Skip to main content
SpringerLink
Log in

Quadratic-Time Linear-Space Algorithms for Generating Orthogonal Polygons with a Given Number of Vertices

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

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3045))

Included in the following conference series:

Abstract

We propose Inflate-Paste – a new technique for generating orthogonal polygons with a given number of vertices from a unit square based on gluing rectangles. It is dual to Inflate-Cut – a technique we introduced in [12] that works by cutting rectangles.

Partially funded by LIACC through Programa de Financiamento Plurianual, Fundaçã o para a Ciência e Tecnologia (FCT) and Programa POSI, and by CEOC (Univ. of Aveiro) through Programa POCTI, FCT, co-financed by EC fund FEDER.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Aichholzer, O., Cortés, C., Demaine, E.D., Dujmovic, V., Erickson, J., Meijer, H., Overmars, M., Palop, B., Ramaswawi, S., Toussaint, G.T.: Flipturning polygons. Discrete Comput. Geom. 28, 231–253 (2002)

    MATH  MathSciNet  Google Scholar 

  2. Bajuelos, A.L., Tomás, A.P., Marques, F.: Partitioning orthogonal polygons by extension of all edges incident to reflex vertices: lower and upper bounds on the number of pieces. In: Laganá, A., Gavrilova, M.L., Kumar, V., Mun, Y., Tan, C.J.K., Gervasi, O. (eds.) ICCSA 2004. LNCS, vol. 3045, pp. 127–136. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  3. Erdös, P.: Problem number 3763. American Mathematical Monthly 42, 627 (1935)

    Article  MathSciNet  Google Scholar 

  4. Joe, B., Simpson, R.B.: Corrections to Lee’s visibility polygon algorithm. BIT 27, 458–473 (1987)

    Article  MATH  Google Scholar 

  5. Lee, D.T.: Visibility of a simple polygon. Computer Vision, Graphics, and Image Processing 22, 207–221 (1983)

    Article  MATH  Google Scholar 

  6. Meisters, G.H.: Polygons have ears. Am. Math. Mon. 82, 648–651 (1975)

    Article  MATH  MathSciNet  Google Scholar 

  7. O’Rourke, J.: An alternate proof of the rectilinear art gallery theorem. J. Geometry 21, 118–130 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  8. O’Rourke, J., Pashchenko, I., Tewari, G.: Partitioning orthogonal polygons into fat rectangles. In: Proc. 13th Canadian Conference on Computational Geometry (CCCG 2001), pp. 133–136 (2001)

    Google Scholar 

  9. Overmars, M., Wood, D.: On rectangular visibility. J. Algorithms 9, 372–390 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  10. Sz.-Nagy, B.: Solution of problem 3763. Am. Math. Mon. 46, 176–177 (1939)

    Article  Google Scholar 

  11. Tomás, A.P., Bajuelos, A.L., Marques, F.: Approximation algorithms to minimum vertex cover problems on polygons and terrains. In: Sloot, P.M.A., Abramson, D., Bogdanov, A.V., Gorbachev, Y.E., Dongarra, J., Zomaya, A.Y. (eds.) ICCS 2003. LNCS, vol. 2657, pp. 869–878. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  12. Tomás, A.P., Bajuelos, A.L.: Generating Random Orthogonal Polygons. In: Postconference Proc. of CAEPIA-TTIA 2003. LNCS (LNAI), Springer, Heidelberg (2003) (to appear)

    Google Scholar 

  13. Toussaint, G.T.: Polygons are anthropomorphic. Am. Math. Mon. 122, 31–35 (1991)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. DCC-FC & LIACC, University of Porto, Portugal

    Ana Paula Tomás

  2. Dept. of Mathematics & CEOC Center for Research in Optimization and Control, University of Aveiro, Portugal

    António Leslie Bajuelos

Authors
  1. Ana Paula Tomás
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. António Leslie Bajuelos
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Chemistry, University of Perugia, Via Elce di Sotto, 8, I-06123, Perugia, Italy

    Antonio Laganá

  2. Department of Computer Science, University of Calgary, 2500 University Drive N.W., T2N 1N4, Calgary, AB, Canada

    Marina L. Gavrilova

  3. William Norris Professor, Head of the Computer Science and Engineering Department, University of Minnesota, USA

    Vipin Kumar

  4. School of Computing, Soongsil University, Seoul, Korea

    Youngsong Mun

  5. OptimaNumerics Ltd., Cathedral House, 23-31 Waring Street, BT1 2DX, Belfast, UK

    C. J. Kenneth Tan

  6. Department of Mathematics and Computer Science, University of Perugia, via Vanvitelli, 1, I-06123, Perugia, Italy

    Osvaldo Gervasi

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tomás, A.P., Bajuelos, A.L. (2004). Quadratic-Time Linear-Space Algorithms for Generating Orthogonal Polygons with a Given Number of Vertices. In: Laganá, A., Gavrilova, M.L., Kumar, V., Mun, Y., Tan, C.J.K., Gervasi, O. (eds) Computational Science and Its Applications – ICCSA 2004. ICCSA 2004. Lecture Notes in Computer Science, vol 3045. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24767-8_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24767-8_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22057-2

  • Online ISBN: 978-3-540-24767-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation