Results 21  30
of
293
Theory and practice of triangle problems in very large (sparse (powerlaw)) graphs
"... Finding, counting and/or listing triangles (three vertices with three edges) in large graphs are natural fundamental problems, which received recently much attention because of their importance in complex network analysis. We provide here a detailed state of the art on these problems, in a unified w ..."
Abstract

Cited by 7 (6 self)
 Add to MetaCart
Finding, counting and/or listing triangles (three vertices with three edges) in large graphs are natural fundamental problems, which received recently much attention because of their importance in complex network analysis. We provide here a detailed state of the art on these problems, in a unified
NOTES ON COMPLEX HYPERBOLIC TRIANGLE GROUPS
"... Abstract. We first demonstrate a family of isomorphisms between complex hyperbolic triangle groups and outline a systematic approach classifying the groups. Then we describe conditions that determine the discreteness of certain groups, in particular we prove a slightly weaker version of a conjecture ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
conjecture given by Schwartz in [11]. Finally we collect together a list of known discrete triangle groups and propose some good candidates for discrete groups. 1.
Triangle counting in dynamic graph streams
"... Estimating the number of triangles in graph streams using a limited amount of memory has become a popular topic in the last decade. Different variations of the problem have been studied depending on whether the graph edges are provided in arbitrary order or as incidence lists. However, with a few ex ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Estimating the number of triangles in graph streams using a limited amount of memory has become a popular topic in the last decade. Different variations of the problem have been studied depending on whether the graph edges are provided in arbitrary order or as incidence lists. However, with a few
Triangle Fixer: Edgebased Connectivity Compression
, 2000
"... Encoding the connectivity of triangle meshes has recently been the subject of intense study and many representations have been proposed [9, 10, 4, 8, 2, 5]. The sudden interest in this area is fueled by the emerging demand for interactive visualization of 3D data sets in a networked environment ( ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
(e.g. VRML over the Internet). Since transmission bandwidth across widearea networks is a scarce resource, compact encodings for 3D models are of great advantage. Common representations for triangle meshes use two lists: a list of vertices and a list of triangles. The list of vertices contains
Memory efficient adjacent triangle connectivity of a vertex using triangle strips
 In Computer Graphics International 2004 (CGI2004) Conference Proceedings
, 2004
"... We often need to refer to adjacent elements (e.g., vertices, edges and faces) in triangle meshes for rendering, mesh simplification and other processes. It is, however, sometimes impossible to prepare the enormous memory needed to represent element connectivity in gigantic triangle meshes. We propos ..."
Abstract
 Add to MetaCart
. First, as our previous scheme, we introduce the constraints to allow random access to a triangle in a sequence of triangle strips. Then, for each face, we construct a list of references to adjacent strips as a representation of triangle connectivity. Experimental results show that, compared
276 [Aug. AN IMPLICIT TRIANGLE OF NUMBERS
"... To Voxn Hoggattt whole common AenAe, plain language, and energetic enthiutaAm brought real mathematics into the Lives ol div&tte people throughout the would. This elementary note introduces a new triangle of numbers that is implicitly defined in Pascal T s Triangle. It shares many properties wit ..."
Abstract
 Add to MetaCart
s Triangle—about the Implicit Triangle, he surprised me by replying that he did not know of either the triangle or any of its properties. Therefore, the following may add to our readers 1 list of "Neat Little Facts about Integers." The question that led to the discovery of the Implicit Triangle is
Census of the complex hyperbolic sporadic triangle groups
, 2010
"... The goal of this paper is to give a conjectural census of complex hyperbolic sporadic triangle groups. We prove that only finitely many of these sporadic groups are lattices. We also give a conjectural list of all lattices among sporadic groups, and for each group in the list we give a conjectural g ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
The goal of this paper is to give a conjectural census of complex hyperbolic sporadic triangle groups. We prove that only finitely many of these sporadic groups are lattices. We also give a conjectural list of all lattices among sporadic groups, and for each group in the list we give a conjectural
Classification of tilings of the 2dimensional sphere by congruent triangles
 Hiroshima Math. J
, 2002
"... We give a new classification of tilings of the 2dimensional sphere by congruent triangles accompanied with a complete proof. This accomplishes the old classification by Davies, who only gave an outline of the proof, regrettably with some redundant tilings. We clarify Davies ’ obscure points, give a ..."
Abstract

Cited by 16 (0 self)
 Add to MetaCart
We give a new classification of tilings of the 2dimensional sphere by congruent triangles accompanied with a complete proof. This accomplishes the old classification by Davies, who only gave an outline of the proof, regrettably with some redundant tilings. We clarify Davies ’ obscure points, give
Skip Strips: Maintaining Triangle Strips for Viewdependent Rendering
, 1999
"... Viewdependent simplification has emerged as a powerful tool for graphics acceleration in visualization of complex environments. However, viewdependent simplification techniques have not been able to take full advantage of the underlying graphics hardware. Specifically, triangle strips are a widely ..."
Abstract

Cited by 36 (4 self)
 Add to MetaCart
Strip, that efficiently maintains triangle strips during such viewdependent changes. A Skip Strip stores the vertex hierarchy nodes in a skiplistlike manner with path compression. We anticipate that Skip Strips will provide a roadmap to combine rendering acceleration techniques for static datasets
Strongly regular graphs with no triangles. Research report
, 2009
"... A simplified version of the theory of strongly regular graphs is developed for the case in which the graphs have no triangles. This leads to (i) direct proofs of the Krein conditions, and (ii) the characterization of strongly regular graphs with no triangles such that the second subconstituent is a ..."
Abstract

Cited by 7 (4 self)
 Add to MetaCart
A simplified version of the theory of strongly regular graphs is developed for the case in which the graphs have no triangles. This leads to (i) direct proofs of the Krein conditions, and (ii) the characterization of strongly regular graphs with no triangles such that the second subconstituent
Results 21  30
of
293