Skip to main content

Advertisement

Log in

Monotone labelings in polygonal tilings

  • Published:
Journal of Heuristics Aims and scope Submit manuscript

Abstract

Labeling the vertices of a finite sequence of polygonal tilings with fewest monotonicity violations enables to represent the tilings by merely specifying sets of vertices—the sequences of their appearance results from the labels. Eventually, this allows a lossless data compression for the sequence of tilings.

The existence and computation of suitable labelings is derived from matching and graph colorings which induce an order on the tilings. This order is series-parallel on each individual tiling.

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

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  • Burrogh, P. A. (1987).Principles of Geographical Information Systems for Land Use Assessment. Oxford: Clarendon Press.

    Google Scholar 

  • Garey, M. R., and D. S.Johnson. (1981).Computers and Intractability. San Francisco: Freeman.

    Google Scholar 

  • Golumbic, M. C. (1980).Algorithmic Graph Theory and Perfect Graphs. New York: Academic Press.

    Google Scholar 

  • Grünbaum, B., and G. C.Shephard. (1986).Tilings and Patterns. New York: Freeman.

    Google Scholar 

  • Kämpke, T. (1994). “Storing and Retrieving Changes in a Sequence of Polygons,”International Journal of Geographical Information Systems 8, 493–513.

    Google Scholar 

  • Kämpke, T. (1996). “Data Compression for Versions of Planar Polygonal Tilings,”Environmetrics, 7, 49–66.

    Google Scholar 

  • Langran, G. (1992).Time in Geographic Information Systems. London: Taylor and Francis.

    Google Scholar 

  • Lawler, E. L. (1976).Combinatorial Optimization: Networks and Matroids. New York: Holt, Rinehart and Winston.

    Google Scholar 

  • Möhring, R. H. (1989). “Computationally Tractable Classes of Ordered Sets.” In I.Rival (ed.),Algorithms and Order. pp. 105–194, Dordrecht: Kluwer.

    Google Scholar 

  • Steiner, G. (1985). “A Compact Labeling Scheme for Series-parallel Graphs,”Discrete Applied Mathematics 11, 281–297.

    Google Scholar 

  • Thulasiraman, K., and M. N. S.Swarmy. (1992).Graphs: Theory and Algorithms. New York: Wiley.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kämpke, T. Monotone labelings in polygonal tilings. J Heuristics 2, 245–278 (1997). https://doi.org/10.1007/BF00127359

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00127359

Keywords

Navigation