Camera Placement -- 3-coloring of a Triangulation

• find 3-coloring by a simple traversal of G(T_P) (such as depth-first search)
• start from any node in G(T_P), and color the vertices of the corresponding triangle in 3 different colors
• when reaching a new node, we are essentially crossing a diagonal
• two vertices on the diagonal are already colored, so we only need to color the last vertex of the newly visited triangle, and we only have one color left

back    next