12194 search results - page 187 / 2439 » cans 2010 |
106
Voted
CCCG
2010
15 years 2 months ago
2010
By a polygonization of a finite point set S in the plane we understand a simple polygon having S as the set of its vertices. Let B and R be sets of blue and red points, respective...
127
Voted
CCCG
2010
15 years 2 months ago
2010
We propose algorithms for efficiently maintaining a constant-approximate minimum connected dominating set (MCDS) of a geometric graph under node insertions and deletions. Assuming...
82
Voted
CCCG
2010
15 years 2 months ago
2010
We explore which polyhedra and polyhedral complexes can be formed by folding up a planar polygonal region and fastening it with one zipper. We call the reverse process a zipper un...
103
click to vote
CRIWG
2010
15 years 2 months ago
2010
It is already known that some collaborative assessment processes can provide students not only the possibility to show how well they have understood knowledge content, but also the...
72
Voted
DAGSTUHL
2010
15 years 2 months ago
2010
Many visual representations for trees have been developed in information and software visualization. One of them are cone trees, a well-known three-dimensional representation for ...