warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
10 years 8 months ago
Counting triangles and the curse of the last reducer
The clustering coefficient of a node in a social network is a fundamental measure that quantifies how tightly-knit the community is around the node. Its computation can be reduce...
Siddharth Suri, Sergei Vassilvitskii
122views more  JCST 2010»
11 years 1 days ago
Harmonic Field Based Volume Model Construction from Triangle Soup
Surface triangle meshes and volume data are two commonly used representations of digital geometry. Converting from triangle meshes to volume data is challenging, since triangle mes...
Chao-Hui Shen, Guo-Xin Zhang, Yu-Kun Lai, Shi-Min ...
84views more  JCT 2008»
11 years 3 days ago
Wild triangles in 3-connected matroids
Let {a, b, c} be a triangle in a 3-connected matroid M. In this paper, we describe the structure of M relative to {a, b, c} when, for all t in {a, b, c}, either M\t is not 3-connec...
James G. Oxley, Charles Semple, Geoff Whittle
184views more  PR 2007»
11 years 1 months ago
Shape retrieval using triangle-area representation and dynamic space warping
We present a shape representation and a matching method for nonrigid shapes with closed contours. The representation utilizes the areas of the triangles formed by the boundary poi...
Naif Alajlan, Ibrahim El Rube, Mohamed S. Kamel, G...
90views more  DM 1999»
11 years 1 months ago
The density of ones in Pascal's rhombus
Pascal's rhombus is a variation of Pascal's triangle in which values are computed as the sum of four terms, rather than two. It is shown that the limiting ratio of the n...
John L. Goldwasser, William Klostermeyer, Michael ...
100views more  MOC 2000»
11 years 1 months ago
Monotonicity preservation on triangles
It is well known that Bernstein polynomials on triangles preserve monotonicity. In this paper we define and study three kinds of monotonicity preservation of systems of bivariate f...
Michael S. Floater, Juan Manuel Peña
88views more  COMBINATORICS 2000»
11 years 1 months ago
Note on Sparse Random Graphs and Cover Graphs
It is shown in this note that with high probability it is enough to destroy all triangles in order to get a cover graph from a random graph Gn,p with p log n/n for any constant ...
Tom Bohman, Alan M. Frieze, Miklós Ruszink&...
83views more  CGF 2007»
11 years 1 months ago
Visibility Sampling on GPU and Applications
In this paper, we show how recent GPUs can be used to very efficiently and conveniently sample the visibility between two surfaces, given a set of occluding triangles. We use bitw...
Elmar Eisemann, Xavier Décoret
87views more  COMBINATORICA 2008»
11 years 1 months ago
Quasi-randomness and the distribution of copies of a fixed graph
We show that if a graph G has the property that all subsets of vertices of size n/4 contain the "correct" number of triangles one would expect to find in a random graph ...
Asaf Shapira
173views more  CGF 2008»
11 years 1 months ago
A Local/Global Approach to Mesh Parameterization
We present a novel approach to parameterize a mesh with disk topology to the plane in a shape-preserving manner. Our key contribution is a local/global algorithm, which combines a...
Ligang Liu, Lei Zhang, Yin Xu, Craig Gotsman, Stev...