Results 1  10
of
28
Multiple source shortest paths in a genus g graph
 Proc. 18th Ann. ACMSIAM Symp. Discrete Algorithms
"... We give an O(g2n log n) algorithm to represent the shortest path tree from all the vertices on a single specified face f in a genus g graph. From this representation, any query distance from a vertex in f can be obtained in O(log n) time. The algorithm uses a kinetic data structure, where the source ..."
Abstract

Cited by 37 (12 self)
 Add to MetaCart
(Show Context)
We give an O(g2n log n) algorithm to represent the shortest path tree from all the vertices on a single specified face f in a genus g graph. From this representation, any query distance from a vertex in f can be obtained in O(log n) time. The algorithm uses a kinetic data structure, where the source of the tree iteratively movesacrossedgesinf. In addition, we give applications using these shortest path trees in order to compute the shortest noncontractible cycle and the shortest nonseparating cycle embedded on an orientable 2manifold in O(g3n log n) time. 1
Minimum Cuts and Shortest Homologous Cycles
 SYMPOSIUM ON COMPUTATIONAL GEOMETRY
, 2009
"... We describe the first algorithms to compute minimum cuts in surfaceembedded graphs in nearlinear time. Given an undirected graph embedded on an orientable surface of genus g, with two specified vertices s and t, our algorithm computes a minimum (s, t)cut in g O(g) n log n time. Except for the spec ..."
Abstract

Cited by 34 (12 self)
 Add to MetaCart
(Show Context)
We describe the first algorithms to compute minimum cuts in surfaceembedded graphs in nearlinear time. Given an undirected graph embedded on an orientable surface of genus g, with two specified vertices s and t, our algorithm computes a minimum (s, t)cut in g O(g) n log n time. Except for the special case of planar graphs, for which O(n log n)time algorithms have been known for more than 20 years, the best previous time bounds for finding minimum cuts in embedded graphs follow from algorithms for general sparse graphs. A slight generalization of our minimumcut algorithm computes a minimumcost subgraph in every Z2homology class. We also prove that finding a minimumcost subgraph homologous to a single input cycle is NPhard.
Computing geometryaware handle and tunnel loops in 3d models
 ACM Trans. Graph
"... Many applications such as topology repair, model editing, surface parameterization, and feature recognition benefit from computing loops on surfaces that wrap around their ‘handles ’ and ‘tunnels’. Computing such loops while optimizing their geometric lengths is difficult. On the other hand, computi ..."
Abstract

Cited by 31 (2 self)
 Add to MetaCart
Many applications such as topology repair, model editing, surface parameterization, and feature recognition benefit from computing loops on surfaces that wrap around their ‘handles ’ and ‘tunnels’. Computing such loops while optimizing their geometric lengths is difficult. On the other hand, computing such loops without considering geometry is easy but may not be very useful. In this paper we strike a balance by computing topologically correct loops that are also geometrically relevant. Our algorithm is a novel application of the concepts from topological persistence introduced recently in computational topology. The usability of the computed loops is demonstrated with some examples in feature identification and topology simplification.
Splitting (Complicated) Surfaces Is Hard
, 2006
"... Let M be an orientable combinatorial surface without boundary. A cycle on M is splitting if it has no selfintersections and it partitions M into two components, neither of which is homeomorphic to a disk. In other words, splitting cycles are simple, separating, and noncontractible. We prove that f ..."
Abstract

Cited by 28 (12 self)
 Add to MetaCart
Let M be an orientable combinatorial surface without boundary. A cycle on M is splitting if it has no selfintersections and it partitions M into two components, neither of which is homeomorphic to a disk. In other words, splitting cycles are simple, separating, and noncontractible. We prove that finding the shortest splitting cycle on a combinatorial surface is NPhard but fixedparameter tractable with respect to the surface genus. Specifically, we describe an algorithm to compute the shortest splitting cycle in g O(g) n log n time.
Optimal Homologous Cycles, Total Unimodularity, and Linear Programming
, 2010
"... Given a simplicial complex with weights on its simplices, and a nontrivial cycle on it, we are interested in finding the cycle with minimal weight which is homologous to the given one. Assuming that the homology is defined with integer (Z) coefficients, we show the following (Theorem 5.2): For a fin ..."
Abstract

Cited by 27 (10 self)
 Add to MetaCart
Given a simplicial complex with weights on its simplices, and a nontrivial cycle on it, we are interested in finding the cycle with minimal weight which is homologous to the given one. Assuming that the homology is defined with integer (Z) coefficients, we show the following (Theorem 5.2): For a finite simplicial complex K of dimension greater than p, the boundary matrix [∂p+1] is totally unimodular if and only if Hp(L, L0) is torsionfree, for all pure subcomplexes L0, L in K of dimensions p and p + 1 respectively, where L0 ⊂ L. Because of the total unimodularity of the boundary matrix, we can solve the optimization problem, which is inherently an integer programming problem, as a linear program and obtain integer solution. Thus the problem of finding optimal cycles in a given homology class can be solved in polynomial time. This result is surprising in the backdrop of a recent result which says that the problem is NPhard under Z2 coefficients which, being a field, is in general easier to deal with. One consequence of our result, among others, is that one can compute in polynomial time an optimal 2cycle in a given homology class for any finite simplicial complex embedded in R 3. Our optimization approach can also be used for various related problems, such as finding an optimal chain homologous to a given one when these are not cycles.
Distributed coverage verification in sensor networks without location information
 IEEE Transactions on Automatic Control
"... Distributed coverage verification in sensor networks without location information ..."
Abstract

Cited by 27 (0 self)
 Add to MetaCart
Distributed coverage verification in sensor networks without location information
Minimum Cuts and Shortest NonSeparating Cycles via Homology Covers
 SYMPOSIUM ON DISCRETE ALGORITHMS
, 2011
"... Let G be a directed graph with weighted edges, embedded on a surface of genus g with b boundaries. We describe an algorithm to compute the shortest directed cycle in G in any given � 2homology class in 2 O(g+b) n log n time; this problem is NPhard even for undirected graphs. We also present two ap ..."
Abstract

Cited by 18 (5 self)
 Add to MetaCart
(Show Context)
Let G be a directed graph with weighted edges, embedded on a surface of genus g with b boundaries. We describe an algorithm to compute the shortest directed cycle in G in any given � 2homology class in 2 O(g+b) n log n time; this problem is NPhard even for undirected graphs. We also present two applications of our algorithm. The first is an algorithm to compute the shortest nonseparating directed cycle in G in 2 O(g) n log n time, improving the recent algorithm of Cabello et al. [SOCG 2010] for all g = o(log n). The second is a combinatorial algorithm to compute minimum (s, t)cuts in undirected surface graphs in 2 O(g) n log n time, improving an algorithm of Chambers et al. [SOCG 2009] for all positive g. Unlike earlier algorithms for surface graphs that construct and search finite portions of the universal cover, our algorithms use another canonical covering space, called the Z 2homology cover.
Finding one tight cycle
 Proc. 19th Ann. ACMSIAM Symp. Discrete Algorithms
"... A cycle on a combinatorial surface is tight if it as short as possible in its (free) homotopy class. We describe an algorithm to compute a single tight, noncontractible, essentially simple cycle on a given orientable combinatorial surface in O(n log n) time. The only method previously known for thi ..."
Abstract

Cited by 15 (10 self)
 Add to MetaCart
(Show Context)
A cycle on a combinatorial surface is tight if it as short as possible in its (free) homotopy class. We describe an algorithm to compute a single tight, noncontractible, essentially simple cycle on a given orientable combinatorial surface in O(n log n) time. The only method previously known for this problem was to compute the globally shortest noncontractible or nonseparating cycle in O(min{g 3, n} nlog n) time, where g is the genus of the surface. As a consequence, we can compute the shortest cycle freely homotopic to a chosen boundary cycle in O(n log n) time, a tight octagonal decomposition in O(gn log n) time, and a shortest contractible cycle enclosing a nonempty set of faces in O(nlog 2 n) time.
Quantifying homology classes II: Localization and stability
, 2007
"... Abstract. In the companion paper [7], we measured homology classes and computed the optimal homology basis. This paper addresses two related problems, namely, localization and stability. We localize a class with the cycle minimizing a certain objective function. We explore three different objective ..."
Abstract

Cited by 15 (2 self)
 Add to MetaCart
(Show Context)
Abstract. In the companion paper [7], we measured homology classes and computed the optimal homology basis. This paper addresses two related problems, namely, localization and stability. We localize a class with the cycle minimizing a certain objective function. We explore three different objective functions, namely, volume, diameter and radius. We show that it is NPhard to compute the smallest cycle using the former two. We also prove that the measurement defined in [7] is stable with regard to small changes of the geometry of the concerned space. 1.
Computing the shortest essential cycle
, 2008
"... An essential cycle on a surface is a simple cycle that cannot be continuously deformed to a point or a single boundary. We describe algorithms to compute the shortest essential cycle in an orientable combinatorial surface in O(n 2 log n) time, or in O(n log n) time when both the genus and number of ..."
Abstract

Cited by 12 (4 self)
 Add to MetaCart
(Show Context)
An essential cycle on a surface is a simple cycle that cannot be continuously deformed to a point or a single boundary. We describe algorithms to compute the shortest essential cycle in an orientable combinatorial surface in O(n 2 log n) time, or in O(n log n) time when both the genus and number of boundaries are fixed. Our result corrects an error in a paper of Erickson and HarPeled.