Computer Science – Computational Geometry
Scientific paper
2008-07-14
Computer Science
Computational Geometry
6 pages, 4 figures. To appear at 16th Int. Symp. Graph Drawing (GD08)
Scientific paper
We describe polynomial time algorithms for determining whether an undirected
graph may be embedded in a distance-preserving way into the hexagonal tiling of
the plane, the diamond structure in three dimensions, or analogous structures
in higher dimensions. The graphs that may be embedded in this way form an
interesting subclass of the partial cubes.
No associations
LandOfFree
Isometric Diamond Subgraphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Isometric Diamond Subgraphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Isometric Diamond Subgraphs will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-443628