19 search results - page 4 / 4 » On crossing numbers of geometric proximity graphs |
FOCS
2006
IEEE
13 years 11 months ago
2006
IEEE
We prove an upper bound, tight up to a factor of 2, for the number of vertices of level at most in an arrangement of n halfspaces in Rd , for arbitrary n and d (in particular, the...
CORR
2004
Springer
13 years 4 months ago
2004
Springer
A (k, t)-track layout of a graph G consists of a (proper) vertex t-colouring of G, a total order of each vertex colour class, and a (non-proper) edge k-colouring such that between...
CVGIP
2007
13 years 5 months ago
2007
Point-based surface processing has developed into an attractive alternative to mesh-based processing techniques for a number of geometric modeling applications. By working with po...
CORR
2011
Springer
13 years 1 days ago
2011
Springer
—The problem of designing policies for in-network function computation with minimum energy consumption subject to a latency constraint is considered. The scaling behavior of the ...