Results 1  10
of
976
A new approach to the maximum flow problem
 JOURNAL OF THE ACM
, 1988
"... All previously known efficient maximumflow algorithms work by finding augmenting paths, either one path at a time (as in the original Ford and Fulkerson algorithm) or all shortestlength augmenting paths at once (using the layered network approach of Dinic). An alternative method based on the pre ..."
Abstract

Cited by 672 (33 self)
 Add to MetaCart
on the preflow concept of Karzanov is introduced. A preflow is like a flow, except that the total amount flowing into a vertex is allowed to exceed the total amount flowing out. The method maintains a preflow in the original network and pushes local flow excess toward the sink along what are estimated
ReTiling Polygonal Surfaces
 Computer Graphics
, 1992
"... This paper presents an automatic method of creating surface models at several levels of detail from an original polygonal description of a given object. Representing models at various levels of detail is important for achieving high frame rates in interactive graphics applications and also for speed ..."
Abstract

Cited by 445 (3 self)
 Add to MetaCart
model and the new points that are to become vertices in the retiled surface. The new model is then created by removing each original vertex and locally retriangulating the surface in a way that matches the local connectedness of the initial surface. This technique for surface retessellation has been
Surface Reconstruction by Voronoi Filtering
 Discrete and Computational Geometry
, 1998
"... We give a simple combinatorial algorithm that computes a piecewiselinear approximation of a smooth surface from a finite set of sample points. The algorithm uses Voronoi vertices to remove triangles from the Delaunay triangulation. We prove the algorithm correct by showing that for densely sampled ..."
Abstract

Cited by 405 (11 self)
 Add to MetaCart
surfaces, where density depends on "local feature size", the output is topologically valid and convergent (both pointwise and in surface normals) to the original surface. We describe an implementation of the algorithm and show example outputs. 1 Introduction The problem of reconstructing a
Vertex Representations and their . . .
, 1998
"... The vertex representation, a new data structure for representing and manipulating orthogonal objects, is presented. Both interiors and boundaries of regions are represented implicitly through the aid of a single vertex which is the tip of an infinite cone. The cones are similar to halfspaces in a CS ..."
Abstract
 Add to MetaCart
was the original formulation of the representation. The vertex representation models the same objects that are obtained through use of methods such as an array of voxels or octrees (i.e., objects with orthogonal faces). Its advantage is that it requires less space and unlike octrees its space requirements
Simplifying Surfaces with Color and Texture using Quadric Error Metrics
, 1998
"... There are a variety of application areas in which there is a need for simplifying complex polygonal surface models. These models often have material properties such as colors, textures, and surface normals. Our surface simplification algorithm, based on iterative edge contraction and quadric error m ..."
Abstract

Cited by 208 (2 self)
 Add to MetaCart
metrics, can rapidly produce high quality approximations of such models. We present a natural extension of our original error metric that can account for a wide range of vertex attributes. CR Categories: I.3.5 [Computer Graphics]: Computational Geometry and Object Modelingsurface and object
A 2approximation algorithm for the undirected feedback vertex set problem
 SIAM J. Discrete Math
, 1999
"... Abstract. A feedback vertex set of a graph is a subset of vertices that contains at least one vertex from every cycle in the graph. The problem considered is that of finding a minimum feedback vertex set given a weighted and undirected graph. We present a simple and efficient approximation algorithm ..."
Abstract

Cited by 93 (0 self)
 Add to MetaCart
the algorithm, is based on a generalized form of the classical local ratio theorem, originally developed for approximation of the vertex cover problem, and a more flexible style of its application.
A mathematical theory of the topological vertex
"... Abstract. We have developed a mathematical theory of the topological vertex— a theory that was originally proposed by M. Aganagic, A. Klemm, M. Mariño, and C. Vafa on effectively computing GromovWitten invariants of smooth toric CalabiYau threefolds derived from duality between open string theory ..."
Abstract

Cited by 35 (19 self)
 Add to MetaCart
Abstract. We have developed a mathematical theory of the topological vertex— a theory that was originally proposed by M. Aganagic, A. Klemm, M. Mariño, and C. Vafa on effectively computing GromovWitten invariants of smooth toric CalabiYau threefolds derived from duality between open string theory
The 6 vertex model and Schubert polynomials
 SIGMA Symmetry Integrability Geom. Methods Appl
, 2007
"... Original article is available at ..."
Extensions and Limits to Vertex Sparsification
"... Suppose we are given a graph G = (V, E) and a set of terminals K ⊂ V. We consider the problem of constructing a graph H = (K, EH) that approximately preserves the congestion of every multicommodity flow with endpoints supported in K. We refer to such a graph as a flow sparsifier. We prove that there ..."
Abstract

Cited by 11 (2 self)
 Add to MetaCart
derived using vertex sparsification in [22]. We also prove an Ω(loglogk) lower bound for how well a flow sparsifier can simultaneously approximate the congestion of every multicommodity flow in the original graph. Our proof crucially relies on a geometric phenomenon pertaining to the unit congestion
On the planewave cubic vertex
"... The exact bosonic Neumann matrices of the cubic vertex in planewave lightcone string field theory are derived using the contour integration techniques developed in our earlier paper. This simplifies the original derivation of the vertex. In particular, the Neumann matrices are written in terms of ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
The exact bosonic Neumann matrices of the cubic vertex in planewave lightcone string field theory are derived using the contour integration techniques developed in our earlier paper. This simplifies the original derivation of the vertex. In particular, the Neumann matrices are written in terms
Results 1  10
of
976