Gray Code Enumeration of Plane Straight-Line Graphs

We develop Gray code enumeration schemes for geometric graphs in the plane. The considered graph classes include plane straight-line graphs, plane spanning trees, and connected plane straight-line graphs. Previous results were restricted to the case where the underlying vertex set is in convex position.

• Type: Journal
• Year: 2007
• Where: GC
• Authors: Oswin Aichholzer, Franz Aurenhammer, Clemens Huemer, Birgit Vogtenhuber
• Keywords: Applied Computing, Code Enumeration Schemes, GC 2007, Geometric Graphs, Plane Straight-line Graphs