JCT
2007
14 years 2 months ago
2007
A topological graph is quasi-planar, if it does not contain three pairwise crossing edges. Agarwal et al. [2] proved that these graphs have a linear number of edges. We give a sim...
GD
2004
Springer
14 years 7 months ago
2004
Springer
Pinchasi and Radoiˇci´c [11] used the following observation to bound the number of edges of a topological graph without a self-crossing cycle of length 4: if we make a list of t...
ICMCS
2005
IEEE
14 years 8 months ago
2005
IEEE
In this paper, we use the three-dimensionaltopological shape information for human face identification. We propose a new method to represent 3D faces as a topological graph. Fine...
COMPGEOM
2006
ACM
14 years 8 months ago
2006
ACM
A topological graph is called k-quasi-planar, if it does not contain k pairwise crossing edges. It is conjectured that for every fixed k, the maximum number of edges in a kquasi-...
COMPGEOM
2009
ACM
14 years 8 months ago
2009
ACM
A topological graph is a graph drawn in the plane with vertices represented by points and edges as arcs connecting its vertices. A k-grid in a topological graph is a pair of edge ...