Results 1  10
of
237
STAMP: Stanford Transactional Applications for MultiProcessing
"... Abstract—Transactional Memory (TM) is emerging as a promising technology to simplify parallel programming. While several TM systems have been proposed in the research literature, we are still missing the tools and workloads necessary to analyze and compare the proposals. Most TM systems have been ev ..."
Abstract

Cited by 206 (9 self)
 Add to MetaCart
(Show Context)
Abstract—Transactional Memory (TM) is emerging as a promising technology to simplify parallel programming. While several TM systems have been proposed in the research literature, we are still missing the tools and workloads necessary to analyze and compare the proposals. Most TM systems have been evaluated using microbenchmarks, which may not be representative of any realworld behavior, or individual applications, which do not stress a wide range of execution scenarios. We introduce the Stanford Transactional Applications for MultiProcessing (STAMP), a comprehensive benchmark suite for evaluating TM systems. STAMP includes eight applications and thirty variants of input parameters and data sets in order to represent several application domains and cover a wide range of transactional execution cases (frequent or rare use of transactions, large or small transactions, high or low contention, etc.). Moreover, STAMP is portable across many types of TM systems, including hardware, software, and hybrid systems. In this paper, we provide descriptions and a detailed characterization of the applications in STAMP. We also use the suite to evaluate six different TM systems, identify their shortcomings, and motivate further research on their performance characteristics. I.
Tetrahedral Mesh Generation by Delaunay Refinement
 Proc. 14th Annu. ACM Sympos. Comput. Geom
, 1998
"... Given a complex of vertices, constraining segments, and planar straightline constraining facets in E 3 , with no input angle less than 90 ffi , an algorithm presented herein can generate a conforming mesh of Delaunay tetrahedra whose circumradiustoshortest edge ratios are no greater than two ..."
Abstract

Cited by 133 (6 self)
 Add to MetaCart
(Show Context)
Given a complex of vertices, constraining segments, and planar straightline constraining facets in E 3 , with no input angle less than 90 ffi , an algorithm presented herein can generate a conforming mesh of Delaunay tetrahedra whose circumradiustoshortest edge ratios are no greater than two. The sizes of the tetrahedra can provably grade from small to large over a relatively short distance. An implementation demonstrates that the algorithm generates excellent meshes, generally surpassing the theoretical bounds, and is effective in eliminating tetrahedra with small or large dihedral angles, although they are not all covered by the theoretical guarantee. 1 Introduction Meshes of triangles or tetrahedra have many applications, including interpolation, rendering, and numerical methods such as the finite element method. Most such applications demand more than just a triangulation of the object or domain being rendered or simulated. To ensure accurate results, the triangles or tetr...
Active Blobs
, 1998
"... A new regionbased approach to nonrigid motion tracking is described. Shape is defined in terms of a deformable triangular mesh that captures object shape plus a color texture map that captures object appearance. Photometric variations are also modeled. Nonrigid shape registration and motion trackin ..."
Abstract

Cited by 99 (6 self)
 Add to MetaCart
(Show Context)
A new regionbased approach to nonrigid motion tracking is described. Shape is defined in terms of a deformable triangular mesh that captures object shape plus a color texture map that captures object appearance. Photometric variations are also modeled. Nonrigid shape registration and motion tracking are achieved by posing the problem as an energybased, robust minimization procedure. The approach provides robustness to occlusions, wrinkles, shadows, and specular highlights. The formulation is tailored to take advantage of texture mapping hardware available in many workstations, PC's, and game consoles. This enables nonrigid tracking at speeds approaching video rate.
Meshing Piecewise Linear Complexes by Constrained Delaunay Tetrahedralizations
 In Proceedings of the 14th International Meshing Roundtable
, 2005
"... Summary. We present a method to decompose an arbitrary 3D piecewise linear complex (PLC) into a constrained Delaunay tetrahedralization (CDT). It successfully resolves the problem of nonexistence of a CDT by updating the input PLC into another PLC which is topologically and geometrically equivalent ..."
Abstract

Cited by 65 (3 self)
 Add to MetaCart
(Show Context)
Summary. We present a method to decompose an arbitrary 3D piecewise linear complex (PLC) into a constrained Delaunay tetrahedralization (CDT). It successfully resolves the problem of nonexistence of a CDT by updating the input PLC into another PLC which is topologically and geometrically equivalent to the original one and does have a CDT. Based on a strong CDT existence condition, the redefinition is done by a segment splitting and vertex perturbation. Once the CDT exists, a practically fast cavity retetrahedralization algorithm recovers the missing facets. This method has been implemented and tested through various examples. In practice, it behaves rather robust and efficient for relatively complicated 3D domains. 1
On Bregman Voronoi Diagrams
 in "Proc. 18th ACMSIAM Sympos. Discrete Algorithms
, 2007
"... The Voronoi diagram of a point set is a fundamental geometric structure that partitions the space into elementary regions of influence defining a discrete proximity graph and dually a wellshaped Delaunay triangulation. In this paper, we investigate a framework for defining and building the Voronoi ..."
Abstract

Cited by 61 (28 self)
 Add to MetaCart
(Show Context)
The Voronoi diagram of a point set is a fundamental geometric structure that partitions the space into elementary regions of influence defining a discrete proximity graph and dually a wellshaped Delaunay triangulation. In this paper, we investigate a framework for defining and building the Voronoi diagrams for a broad class of distortion measures called Bregman divergences, that includes not only the traditional (squared) Euclidean distance, but also various divergence measures based on entropic functions. As a byproduct, Bregman Voronoi diagrams allow one to define informationtheoretic Voronoi diagrams in statistical parametric spaces based on the relative entropy of distributions. We show that for a given Bregman divergence, one can define several types of Voronoi diagrams related to each other
Anisotropic Voronoi Diagrams and GuaranteedQuality Anisotropic Mesh Generation
 in SCG ’03: Proceedings of the nineteenth annual symposium on Computational geometry
, 2003
"... We introduce anisotropic Voronoi diagrams, a generalization of multiplicatively weighted Voronoi diagrams suitable for generating guaranteedquality meshes of domains in which long, skinny triangles are required, and where the desired anisotropy varies over the domain. We discuss properties of aniso ..."
Abstract

Cited by 60 (2 self)
 Add to MetaCart
(Show Context)
We introduce anisotropic Voronoi diagrams, a generalization of multiplicatively weighted Voronoi diagrams suitable for generating guaranteedquality meshes of domains in which long, skinny triangles are required, and where the desired anisotropy varies over the domain. We discuss properties of anisotropic Voronoi diagrams of arbitrary dimensionalitymost notably circumstances in which a site can see its entire Voronoi cell. In two dimensions, the anisotropic Voronoi diagram dualizes to a triangulation under these same circumstances. We use these properties to develop an algorithm for anisotropic triangular mesh generation in which no triangle has an angle smaller than 20 # , as measured from the skewed perspective of any point in the triangle.
What Is a Good Linear Finite Element?  Interpolation, Conditioning, Anisotropy, and Quality Measures
 In Proc. of the 11th International Meshing Roundtable
, 2002
"... When a mesh of simplicial elements (triangles or tetrahedra) is used to form a piecewise linear approximation of a function, the accuracy of the approximation depends on the sizes and shapes of the elements. In finite element methods, the conditioning of the stiffness matrices also depends on the si ..."
Abstract

Cited by 57 (0 self)
 Add to MetaCart
(Show Context)
When a mesh of simplicial elements (triangles or tetrahedra) is used to form a piecewise linear approximation of a function, the accuracy of the approximation depends on the sizes and shapes of the elements. In finite element methods, the conditioning of the stiffness matrices also depends on the sizes and shapes of the elements. This article explains the mathematical connections between mesh geometry, interpolation errors, discretization errors, and stiffness matrix conditioning. These relationships are expressed by error bounds and element quality measures that determine the fitness of a triangle or tetrahedron for interpolation or for achieving low condition numbers. Unfortunately, the quality measures for these purposes do not fully agree with each other; for instance, small angles are bad for matrix conditioning but not for interpolation or discretization. The upper and lower bounds on interpolation error and element stiffness matrix conditioning given here are tighter than those usually seen in the literature, so the quality measures are likely to be unusually precise indicators of element fitness. Bounds are included for anisotropic cases, wherein long, thin elements perform better than equilateral ones. Surprisingly, there are circumstances wherein interpolation, conditioning, and discretization error are each best served by elements of different aspect ratios or orientations.
Mesh Generation
 HANDBOOK OF COMPUTATIONAL GEOMETRY. ELSEVIER SCIENCE
, 2000
"... ..."
(Show Context)