Abstract
Koebe’s Theorem [8] proves that any planar graph is the contact graph of a set of coins in the plane. But not any planar geometric graph can be realized as a coin graph (with coins centered at the vertices of the graph). This paper presents an algorithm to decide whether a planar connected geometric graph is a coin graph and to obtain, in the affirmative case, all the coin sets whose contact graphs are the given graph. This result is generalized to other metrics different from the Euclidean metric and is applied to a problem in mechanical gear systems. Two related optimization problems are also considered. They are motivated by graph drawing problems in Geographical Information Systems and Architectural Design Systems.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Aurenhammer, F., Klein, R.: Voronoi diagrams. In: Sack, J.R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 201–290. North-Holland, Amsterdam (2000)
Klein, R.: Concrete and Abstract Voronoi Diagrams. LNCS, vol. 400. Springer, Heidelberg (1989)
Meggido, N.: Linear Programming in Linear Time when the Dimension is Fixed. J. Assoc. Comput. Mach (USA) 31(1), 114–127 (1984)
Moreno, C.: An applet to realize a geometric planar graph as a gear system, http://www.dma.fi.upm.es/research/geocomp/coin/circulos.html
Moreno, C.: Algunos problemas de Geometría Computacional en Ingeniería Mecánica, Ph.D (in preparation)
Münch, O.: VoroCircles: an applet to draw Voronoi diagrams with additive weights (2001), http://web.informatik.uni-bonn.de/I/GeomLab/apps/voroadd/index.html/
Okabe, et al.: Spatial Tessellations: concepts and applications of Voronoi diagrams. John Wiley & sons, Chichester (1992)
Pach, J., Agarwal, P.K.: A proof of Koebe’s theorem can be found in Combinatorial Geometry. John Wiley and Sons, Chichester (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Abellanas, M., Moreno-Jiménez, C. (2004). Geometric Graphs Realization as Coin Graphs. 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_1
Download citation
DOI: https://doi.org/10.1007/978-3-540-24767-8_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22057-2
Online ISBN: 978-3-540-24767-8
eBook Packages: Springer Book Archive