56 search results - page 7 / 12 » Holes in Graphs |
118
click to vote
COMPGEOM
2004
ACM
15 years 9 months ago
2004
ACM
We study the problem of computing the visibility graph defined by a set P of n points inside a polygon Q: two points p, q ∈ P are joined by an edge if the segment pq ⊂ Q. Ef...
139
click to vote
3DIM
2003
IEEE
15 years 9 months ago
2003
IEEE
Segmentation of 3D human body (HB) scan is a very challenging problem in applications exploiting human scan data. To tackle this problem, this paper proposes a topological approac...
114
click to vote
WDAG
2007
Springer
15 years 10 months ago
2007
Springer
A group of identical mobile agents moving asynchronously among the nodes of an anonymous network have to gather together in a single node of the graph. This problem known as the (a...
130
Voted
ICIAP
2003
ACM
16 years 4 months ago
2003
ACM
Segmentation of 3D human body is a very challenging problem in applications exploiting human scan data. To tackle this problem, this paper proposes a topological approach based on...
121
Voted
FUN
2010
Springer
15 years 8 months ago
2010
Springer
We consider a class of highly dynamic networks modelled on an urban subway system. We examine the problem of creating a map of such a subway in less than ideal conditions, where th...