28 search results - page 2 / 6 » On sequential triangulations of simple polygons |
CAGD
2008
13 years 6 months ago
2008
A simple proof is provided for the fact that the set of all possible triangulations of a planar point set in a polygonal domain is closed under the basic diagonal flip operation.
FOCS
1990
IEEE
13 years 10 months ago
1990
IEEE
AAAI
2007
13 years 8 months ago
2007
We consider problems of geometric exploration and selfdeployment for simple robots that can only sense the combinatorial (non-metric) features of their surroundings. Even with suc...
COMPGEOM
1993
ACM
13 years 10 months ago
1993
ACM
For a polygon P, the bounded Voronoi diagram of P is a partition of P into regions assigned to the vertices of P. A point p inside P belongs to the region of a vertex v if and onl...
EJC
1998
13 years 6 months ago
1998
in Proceedings of EuroCG, Berlin, M¨arz 2001, pp. 142–145. [14] Branched coverings, triangulations, and 3-manifolds, (mit Ivan Izmestiev). Adv. Geometry, 3:191–225, 2003. [15]...