47 search results - page 6 / 10 » cccg 2008 |
CCCG
2008
15 years 1 months ago
2008
We study the problem of computing Voronoi diagrams distributedly for a set of nodes of a network modeled as a Unit Disk Graph (UDG). We present an algorithm to solve this problem ...
117
click to vote
CCCG
2008
15 years 1 months ago
2008
A circle C is occluded by a set of circles C1, . . . , Cn if every line that intersects C also intersects at least one of the Ci, i = 1, . . . , n. In this paper, we focus on dete...
CCCG
2008
15 years 1 months ago
2008
We consider the problem of embroidering a design pattern, given by a graph G, using a single minimum length thread. We give an exact polynomial-time algorithm for the case that G ...
65
Voted
CCCG
2008
15 years 1 months ago
2008
Homometric rhythms/chords (henceforth: rhythms) are those with the same histogram or multiset of intervals/distances. The purpose of this note is threefold. First to point out the...
CCCG
2008
15 years 1 months ago
2008
We present a novel approach to morph between two isometric poses of the same non-rigid object given as triangular meshes. We model the morphs as linear interpolations in a suitabl...