Skip to search formSkip to main contentSkip to account menu

Contact graph

Known as: Tangency graph 
In the mathematical area of graph theory, a contact graph or tangency graph is a graph whose vertices are represented by geometric objects (e.g… 
Wikipedia (opens in a new tab)

Related topics

Related topics

6 relations
Circle packing theoremGeometric separatorGraph (discrete mathematics)Graph theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Delay Analysis of Epidemic Schemes in Sparse and Dense Heterogeneous Contact Networks
Epidemic algorithms have found their way into many areas of computer science, such as databases and distributed systems, and… 
2014
2014
Stalk me if you can: the anatomy of sybil attacks in opportunistic networks
Opportunistic Networks are envisioned to complement infrastruc-ture-based communication in overloaded cellular settings, in… 
2013
2013
Social and location based routing in delay tolerant networks
Delay tolerant networks (DTNs) are a special type of wireless mobile networks, which may lack continuous network connectivity… 
2013
2013
Illustrating the disassembly of 3D models
2011
2011
A domain decomposition method for granular dynamics using discrete elements and application to railway ballast
The paper is devoted to the development of a non overlapping domain decomposition method suited to granular dynamics. The… 
2010
2010
Applications of Three Dimensional Extremal Length, I: Tiling of a Topological Cube
Given a triangulation of a closed topological cube, we show that (under some technical condition) there is an essentially unique… 
2004
2004
Contact and Intersection Representations
A necessary and sufficient condition is given for a connected bipartite graph to be the incidence graph of a family of segments… 
1997
1997
Bifurcations of systems with structurally unstable homoclinic orbits and moduli of ω-equivalence
1995
1995
Recurrent random walks, Liouville's theorem and circle packings
  • T. Dubejko
  • Mathematical Proceedings of the Cambridge…
  • 1995
  • Corpus ID: 5631354
It has been shown that univalent circle packings filling the complex plane C are unique up to similarities of C. Here we prove… 
1993
1993
An optimum path and posture planning for fixtureless assembly
  • P. I. RoB. Lee
  • [] Proceedings IEEE International Conference on…
  • 1993
  • Corpus ID: 42263426
A strategy is discussed for assembly path planning of parts to be assembled by two assembly robots in a working space. Path… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)