Results 1  10
of
1,571
Surface Simplification Using Quadric Error Metrics
"... Many applications in computer graphics require complex, highly detailed models. However, the level of detail actually necessary may vary considerably. To control processing time, it is often desirable to use approximations in place of excessively detailed models. We have developed a surface simplifi ..."
Abstract

Cited by 1174 (16 self)
 Add to MetaCart
simplification algorithm which can rapidly produce high quality approximations of polygonal models. The algorithm uses iterative contractions of vertex pairs to simplify models and maintains surface error approximations using quadric matrices. By contracting arbitrary vertex pairs (not just edges), our algorithm
Finding a Closest Visible Vertex Pair Between Two Polygons
 TO APPEAR IN ALGORITHMICA
"... Given nonintersecting simple polygons P and Q, two vertices p 2 P and q 2 Q are said to be visible if pq does not properly intersect P or Q. We present a parallel algorithm for finding a closest pair among all visible pairs (p; q), p 2 P and q 2 Q. The algorithm runs in time O(log n) using O(n) proc ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Given nonintersecting simple polygons P and Q, two vertices p 2 P and q 2 Q are said to be visible if pq does not properly intersect P or Q. We present a parallel algorithm for finding a closest pair among all visible pairs (p; q), p 2 P and q 2 Q. The algorithm runs in time O(log n) using O
COUNTING EQUIVALENCE CLASSES OF VERTEX PAIRS MODULO THE DIHEDRAL ACTION ON THE ASSOCIAHEDRON
, 2012
"... This paper proves explicit formulae for the number of edges, 2sets and diagonals in the associahedron of dimension n modulo the action of the dihedral group. A generating function for the number of ksets modulo this action, as well as a formula for the cycle index, is given. A table of values is ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
This paper proves explicit formulae for the number of edges, 2sets and diagonals in the associahedron of dimension n modulo the action of the dihedral group. A generating function for the number of ksets modulo this action, as well as a formula for the cycle index, is given. A table of values is also provided.
Visualization of Genetic Networks: Edge Crossing Minimization of a Graph Drawing with Vertex Pairs
 Genome Informatics
, 2000
"... Introduction Inference of genetic networksfrom expression profile data is still one of the challenging works in the field of themO11+b(O yinformzMTTM A good visualization tool would provide us a great insight into the interactionsamac the genes in the inferred networks. Here, we focus on the tim se ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
gene. The causality between a pair of genes is expressed as an edgefrom a vertex in the layer for tim t to a vertex in the layer for tim t + 1. There is a restriction for drawing twolayered graphs for genetic networks that the sam gene should occupy the sam positions in the two layers. In drawing a
Finding the k Shortest Paths
, 1997
"... We give algorithms for finding the k shortest paths (not required to be simple) connecting a pair of vertices in a digraph. Our algorithms output an implicit representation of these paths in a digraph with n vertices and m edges, in time O(m + n log n + k). We can also find the k shortest pat ..."
Abstract

Cited by 401 (2 self)
 Add to MetaCart
We give algorithms for finding the k shortest paths (not required to be simple) connecting a pair of vertices in a digraph. Our algorithms output an implicit representation of these paths in a digraph with n vertices and m edges, in time O(m + n log n + k). We can also find the k shortest
Twisted representations of vertex operator algebras
"... Abstract. Let V be a vertex operator algebra and g an automorphism of finite order. We construct an associative algebra Ag(V) and a pair of functors between the category of Ag(V)modules and a certain category of admissible gtwisted Vmodules. In particular, these functors exhibit a bijection betwe ..."
Abstract

Cited by 160 (65 self)
 Add to MetaCart
Abstract. Let V be a vertex operator algebra and g an automorphism of finite order. We construct an associative algebra Ag(V) and a pair of functors between the category of Ag(V)modules and a certain category of admissible gtwisted Vmodules. In particular, these functors exhibit a bijection
Forbidden Pairs for VertexDisjoint Claws
"... Let k ≥ 4, and let H1,H2 be connected graphs with V (Hi)  ≥ 3 for i = 1, 2. A graph G is said to be {H1,...,Hl}free if none of H1,...,Hl is an induced subgraph of G. We prove that if there exists a positive integer n0 such that every {H1,H2}free graph G with V (G)  ≥ n0 and δ(G) ≥ 3 contains ..."
Abstract
 Add to MetaCart
contains k vertexdisjoint claws, then {H1,H2}∩{K1,t  t ≥ 2} � = ∅. Also, we prove that every K1,rfree graph of sufficiently large order with minimum degree at least t contains k vertexdisjoint copies of K1,t.
The 3fold vertex via stable pairs
"... Abstract. The theory of stable pairs in the derived category yields an enumerative geometry of curves in 3folds. We evaluate the equivariant vertex for stable pairs on toric 3folds in terms of weighted box counting. In the toric CalabiYau case, the result simplifies to a new form of pure box coun ..."
Abstract

Cited by 20 (5 self)
 Add to MetaCart
Abstract. The theory of stable pairs in the derived category yields an enumerative geometry of curves in 3folds. We evaluate the equivariant vertex for stable pairs on toric 3folds in terms of weighted box counting. In the toric CalabiYau case, the result simplifies to a new form of pure box
Results 1  10
of
1,571