14 search results - page 2 / 3 » Detecting Holes and Antiholes in Graphs |
DIALM
2005
ACM
13 years 7 months ago
2005
ACM
The identification of holes in a wireless sensor network is of primary interest since the breakdown of sensor nodes in a larger area often indicates one of the special events to ...
COMPUTING
1999
13 years 5 months ago
1999
In line image understandingaminimal lineproperty preserving(MLPP)graphoftheimagecompliments the structural information in geometric graph representations like the run graph. With ...
JCT
2008
13 years 5 months ago
2008
A hole in a graph is an induced cycle on at least four vertices. A graph is Berge if it has no odd hole and if its complement has no odd hole. In 2002, Chudnovsky, Robertson, Seym...
COMPGEOM
2004
ACM
13 years 10 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...
3DIM
2003
IEEE
13 years 10 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...