KAIS
2011
13 years 6 months ago
2011
Triangle counting is an important problem in graph mining. Two frequently used metrics in complex network analysis which require the count of triangles are the clustering coefficie...
CPC
2011
13 years 6 months ago
2011
Let X be the random variable that counts the number of triangles in the binomial random graph G(n, p). We show that for some positive constant c, the probability that X deviates f...
PVLDB
2010
13 years 9 months ago
2010
This paper introduces a new definition of dense subgraph pattern, the DN-graph. DN-graph considers both the size of the sub-structure and the minimum level of interactions betwee...
PRESENCE
1998
13 years 11 months ago
1998
Many multiresolution methods have been proposed. Most of them emphasize accuracy and hence are slow. Some methods may be fast, but they may not preserve the geometry of the model....
JCISE
2002
13 years 11 months ago
2002
The extraction and display of iso-surfaces is a standard method for the visualization of volume data sets. In this paper we present a novel approach that utilizes a hierarchy on b...
CAGD
2004
13 years 11 months ago
2004
The four-triangles longest-edge (4T-LE) partition of a triangle t is obtained by joining the midpoint of the longest edge of t to the opposite vertex and to the midpoints of the t...
TVCG
2008
13 years 11 months ago
2008
In this paper we present an algorithm that operates on a triangular mesh and classifies each face of a triangle as either inside or outside. We present three example applications o...
SIAMDM
2008
13 years 11 months ago
2008
We prove a conjecture of Erdos, Purdy, and Straus on the number of distinct areas of triangles determined by a set of n points in the plane. We show that if P is a set of n points...
COMBINATORICS
2007
13 years 11 months ago
2007
Sommerville and Davies classified the spherical triangles that can tile the sphere in an edge-to-edge fashion. However, if the edge-to-edge restriction is relaxed, there are othe...
CAGD
2007
13 years 11 months ago
2007
We introduce a geometrical diagram to study the improvement in shape of triangles generated by iterative application of triangle subdivision. The four Triangles Longest Edge (4TLE...