Title :
Reconstruction of planar graphs from their centered triangulations in some spatio-relational models
Author :
Novák, Agnes B. ; Tuza, Zsolt
Author_Institution :
Budapest Tech., Peter Pazmany Catholic Univ., Budapest, Hungary
Abstract :
In this paper we continue the investigation of an interoperability problem and its complexity in connection with spatio-relational database models. The result, however, is also interesting from the point of view of graph theory, since the main result is that there is a linear-time algorithm for deciding whether a given triangulation can be seen as a centered triangulation of a certain planar graph.
Keywords :
computational complexity; graph theory; mesh generation; relational databases; visual databases; centered triangulation; graph theory; interoperability problem; linear-time algorithm; planar graph; spatio-relational database model; Data models; Data structures; Graph theory; Programmable logic arrays; Relational databases; Solid modeling; Spatial databases; Spatiotemporal phenomena; Topology;
Conference_Titel :
Computational Cybernetics, 2005. ICCC 2005. IEEE 3rd International Conference on
Print_ISBN :
0-7803-9122-5
DOI :
10.1109/ICCCYB.2005.1511570
