176 search results - page 22 / 36 » Unbalanced Points and Vertices Problem |
DM
2010
14 years 9 months ago
2010
Let H 2V be a hypergraph on vertex set V . For a positive integer r, we call H r-exact, if any minimal transversal of H intersects any hyperedge of H in at most r vertices. This ...
116
click to vote
DMTCS
2010
14 years 6 months ago
2010
A geometric graph is a graph G = (V, E) drawn in the plane, such that V is a point set in general position and E is a set of straight-line segments whose endpoints belong to V . W...
IROS
2006
IEEE
15 years 3 months ago
2006
IEEE
— This paper formalizes and proposes an algorithm to compute coverage diameters of polygons in 2D. Roughly speaking, the coverage diameter of a polygon is the longest possible di...
SIBGRAPI
1999
IEEE
15 years 1 months ago
1999
IEEE
Abstract. In this work we study the problem of reconstructing an image from a perceptual segmentation based on a geometric classification of its points using non-linear curvature f...
JCT
2007
14 years 9 months ago
2007
A topological graph is quasi-planar, if it does not contain three pairwise crossing edges. Agarwal et al. [2] proved that these graphs have a linear number of edges. We give a sim...