What is the subset of planar graphs which can be Delauney triangulations of some arrangement of points on a plane?
The goal is to encode data, possibly steganography: For a given set of unlabeled points, compute its Delauney triangulation. Look up the index of the graph among all possible Delaunay graphs. And the reverse, requiring a one-to-one mapping.
No comments :
Post a Comment