F. Harary and J. Nieminen. Convexity in graphs. Journal of Differential Geometry, 16:185--190, 1981. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Grey Scale Convex Hulls: Definition, Implementation and Application - Soille (Correct)
....one shortest path or geodesic linking u to v while remaining in S. 3. A set of points S within a grid is convex if it is equivalent to points falling within the intersection of all half planes containing S. These definitions and further discussions about digital convexity issues can be found in [17, 8, 10, 11, 12, 7]. In [16] a set is said to be weakly or strongly convex depending on whether it satisfies the first or the second definition. Since the intersection of any family of convex sets is also a convex set, there exists a smallest convex set containing any given set. The smallest convex set containing ....
F. Harary and J. Nieminen. Convexity in graphs. Journal of Differential Geometry, 16:185--190, 1981.
From Binary to Grey Scale Convex Hulls - Soille (2000) (Correct)
....the notion of strong convex hull. A compact contour code representation of strong convex figures for 8 connected graphs is detailed in [5] 2. A set of vertices of a graph 6 is convex if, for all u, v C , there exists at least one shortest path, or geodesic, linking u to v while remaining in [8]. This definition is less restrictive than the previous one. In [22] it is called weak convexity and leads to the notion of weak convex hull. An early algorithm, producing the weak convex hull of a connected set of grid nodes in the 4 connected square grid, has been proposed in [32] see [1] for ....
F. Harary and J. Nieminen. Convexity in graphs. Journal of Differential Geometry, 16:185- 190, 1981.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC