Camera Placement -- 3-coloring of a Triangulation

• 3-coloring always exists
• let T_P be the triangulation of polygon P
• dual graph of T_P, G(T_P), is a tree (it has a node for every trinagle in T_P, and its edges are diagonals of T_P)


• find 3-coloring by a simple traversal of G(T_P) (such as depth-first search)

back    next