66 search results - page 9 / 14 » cccg 2010 |
CCCG
2010
14 years 11 months ago
2010
Extending a bijection recently introduced by Poulalhon and Schaeffer [15] for triangulations of the sphere we design an efficient algorithm for encoding (topological) triangulatio...
CCCG
2010
14 years 11 months ago
2010
In this paper we consider a wireless network, where each transceiver is equipped with a directional antenna, and study two direction assignment problems, determined by the type of...
CCCG
2010
14 years 11 months ago
2010
A planar point set S is an (i, t) set of ghost chimneys if there exist lines H0, H1, . . . , Ht-1 such that the orthogonal projection of S onto Hj consists of exactly i + j distin...
CCCG
2010
14 years 11 months ago
2010
In this paper, we enumerate the number of combinatorial changes of the the Euclidean minimum spanning tree (EMST) of a set of n moving points in 2dimensional space. We assume that...
CCCG
2010
14 years 11 months ago
2010
A dominating set of a graph G = (V, E) is a subset V V of the nodes such that for all nodes v V , either v V or a neighbor u of v is in V . Several routing protocols in ad hoc ...