Results 11  20
of
293
Mainmemory triangle computations for very large (sparse (powerlaw)) graphs
 Theor. Comput. Sci
"... Finding, counting and/or listing triangles (three vertices with three edges) in massive graphs are natural fundamental problems, which received recently much attention because of their importance in complex network analysis. We provide here a detailed survey of proposed mainmemory solutions to thes ..."
Abstract

Cited by 44 (0 self)
 Add to MetaCart
Finding, counting and/or listing triangles (three vertices with three edges) in massive graphs are natural fundamental problems, which received recently much attention because of their importance in complex network analysis. We provide here a detailed survey of proposed mainmemory solutions
Dynamic ViewDependent Simplification for Polygonal Models
, 1996
"... We present an algorithm for performing viewdependent simplifications of a triangulated polygonal model in realtime. The simplifications are dependent on viewing direction, lighting, and visibility and are performed by taking advantage of imagespace, objectspace, and frametoframe coherences. A c ..."
Abstract

Cited by 186 (1 self)
 Add to MetaCart
continuous levelofdetail representation for an object is first constructed offline. This representation is then used at runtime to guide the selection of appropriate triangles for display. The list of displayed triangles is updated incrementally from one frame to the next. Our approach is more effective
On the generation of Heronian triangles
"... We describe several algorithms for the generation of integer Heronian triangles with diameter at most n. Two of them have running time O `n2+ε´. We enumerate all integer Heronian triangles for n ≤ 600000 and apply the complete list on some related problems. ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
We describe several algorithms for the generation of integer Heronian triangles with diameter at most n. Two of them have running time O `n2+ε´. We enumerate all integer Heronian triangles for n ≤ 600000 and apply the complete list on some related problems.
DYNKIN GRAPHS AND TRIANGLE SINGULARITIES
, 1994
"... In Arnold’s classification list of singularities (Arnold [1].) we find interesting singularities to be studied. Though we find singularities of any dimension in Arnold’s list, we consider singularities of dimension two in particular. Among them there is a class called exceptional singularities or tr ..."
Abstract
 Add to MetaCart
In Arnold’s classification list of singularities (Arnold [1].) we find interesting singularities to be studied. Though we find singularities of any dimension in Arnold’s list, we consider singularities of dimension two in particular. Among them there is a class called exceptional singularities
PixelFlow: HighSpeed Rendering Using Image Composition
 Computer Graphics (Proc. SIGGRAPH
, 1992
"... We describe PixelFlow, an architecture for highspeed image generation that overcomes the transformation and framebuffer– access bottlenecks of conventional hardware rendering architectures. PixelFlow uses the technique of image composition: it distributes the rendering task over an array of ident ..."
Abstract

Cited by 180 (4 self)
 Add to MetaCart
of renderers; there is no fundamental limit to the maximum performance achievable using this approach. A single PixelFlow renderer rasterizes up to 1.4 million triangles per second, and an nrenderer system can rasterize at up to n times this basic rate. PixelFlow performs antialiasing by supersampling
Triangle Order Optimization
"... classroom use is granted without fee provided that copies are not made or distributed for commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitt ..."
Abstract
 Add to MetaCart
is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee.
Constructions for Difference Triangle Sets
"... © 2009 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other w ..."
Abstract
 Add to MetaCart
© 2009 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other
Smaller planar trianglefree graphs that are not 3listcolorable
, 2005
"... In 1995, Voigt constructed a planar trianglefree graph that is not 3listcolorable. It has 166 vertices. Gutner then constructed such a graph with 164 vertices. We present two more graphs with these properties. The first graph has 97 vertices and a failing list assignment using triples from a set ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In 1995, Voigt constructed a planar trianglefree graph that is not 3listcolorable. It has 166 vertices. Gutner then constructed such a graph with 164 vertices. We present two more graphs with these properties. The first graph has 97 vertices and a failing list assignment using triples from a set
(VAAL TRIANGLE FACULTY)
, 2005
"... It is with due submission, a humble sense of relief, gratitude, achievement and appreciation that I compile this page. The list of persons to thank is extensive and I mention the names in no particular order of priority. I wish to express my sincere gratitude: To the Almighty God, our Heavenly Fathe ..."
Abstract
 Add to MetaCart
It is with due submission, a humble sense of relief, gratitude, achievement and appreciation that I compile this page. The list of persons to thank is extensive and I mention the names in no particular order of priority. I wish to express my sincere gratitude: To the Almighty God, our Heavenly
Subcubic Equivalences Between Path, Matrix, and Triangle Problems
"... We say an algorithm on n × n matrices with entries in [−M,M] (or nnode graphs with edge weights from [−M,M]) is truly subcubic if it runs in O(n 3−δ · poly(log M)) time for some δ> 0. We define a notion of subcubic reducibility, and show that many important problems on graphs and matrices solvab ..."
Abstract

Cited by 42 (11 self)
 Add to MetaCart
weight. • Listing up to n 2.99 negative triangles in an edgeweighted graph. • Finding a minimum weight cycle in a graph of nonnegative edge weights. • The replacement paths problem on weighted digraphs. • Finding the second shortest simple path between two nodes in a weighted digraph. • Checking
Results 11  20
of
293