| Geometric Games on Triangulations Extended Abstract (2009) | |||||||||||||||
Abstract | |||||||||||||||
| Let S be a set of n points in the plane, which we assume to be in general position, i.e., no three points of S lie on the same line. A triangulation of S is a simplicial decomposition of its convex hull having S as vertex set. In this work we consider several perfect-information combinatorial games involving the vertices, | |||||||||||||||
Publication details | |||||||||||||||
| |||||||||||||||