56 search results - page 7 / 12 » Holes in Graphs |
COMPGEOM
2004
ACM
14 years 27 days 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...
3DIM
2003
IEEE
14 years 23 days 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...
WDAG
2007
Springer
14 years 1 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...
ICIAP
2003
ACM
14 years 7 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...
FUN
2010
Springer
14 years 8 days 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...