Bipartite graph matching for points on a line or a circle
Journal of Algorithms
A linear time algorithm for a matching problem on the circle
Information Processing Letters
Graphs, Networks and Algorithms (Algorithms and Computation in Mathematics)
Graphs, Networks and Algorithms (Algorithms and Computation in Mathematics)
A unifying approach to isotropic and anisotropic total variation denoising models
Journal of Computational and Applied Mathematics
| Hi-index | 0.04 |
Let G=(V,E) be a graph that is embedded in the plane, i.e. V is a finite vertex set of points in the plane and the edge set E is represented as a set of (straight-line) segments in the plane with endpoints from V. A trail is a sequence T=(e"1,...,e"k) of pairwise distinct edges such that there are vertices v"0,...,v"k with e"i=v"i"-"1v"i for i@?{1,...,k}. Consecutive edges of a trail form an angle in the plane and with each such angle @a we assign a geometrically motivated value z(@a). The weight of T is defined as the sum of these z-values. We study the problem of partitioning the graph into trails, i.e. decomposing the edge set of the graph into a disjoint union of edge sets of trails, such that the sum of their weights is maximal. We reduce the problem to a matching problem on the circle and present an efficient matching algorithm. The problem is motivated by an application in image processing.