Homeomorphism (graph theory)

Known as: Graph subdivision, Smoothing out, Graph homeomorphism 
In graph theory, two graphs and are homeomorphic if there is a graph isomorphism from some of to some subdivision of . If the edges of a graph are… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1936-2017
010020030019362016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
We introduce a notion of graph homeomorphisms which uses the concept of dimension and homotopy for graphs. It preserves the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2002
Highly Cited
2002
We present an algorithm to efficiently and robustly process collisions, contact and friction in cloth simulation. It works with… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2000
Highly Cited
2000
We propose a new progressive compression scheme for arbitrary topology, highly detailed and densely sampled meshes arising from… (More)
Is this relevant?
Highly Cited
1998
Highly Cited
1998
During the last years the concept of multi-resolution modeling has gained special attention in many fields of computer graphics… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1998
Highly Cited
1998
We construct smooth parameterizations of irregular connectivity triangulations of arbitrary genus 2-manifolds. Our algorithm uses… (More)
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Multiresolution analysis and wavelets provide useful and efficient tools for representing functions at multiple levels of detail… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Level-of-detail (LOD) representations are an important tool for realtime rendering of complex geometric environments. The… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
Highly Cited
1994
Highly Cited
1994
We present a general method for automatic reconstruction of accurate, concise, piecewise smooth surface models from scattered… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
Highly Cited
1993
Highly Cited
1993
An ideal visibility algorithm should a) quickly reject most of the hidden geometry in a model and b) exploit the spatial and… (More)
  • figure 3
Is this relevant?
Highly Cited
1986
Highly Cited
1986
Until recently the gravitational N-body problem has been modelled numerically either by direct integration, in which the… (More)
Is this relevant?