947 search results - page 98 / 190 » Discrete Geometry |
ICIP
2006
IEEE
15 years 11 months ago
2006
IEEE
In this paper we propose a geometrical entropy coder to compress images with geometry. Our proposed scheme works on quantized coefficients of the discrete wavelet transform (DWT)....
COCOA
2007
Springer
15 years 4 months ago
2007
Springer
We consider the problem of connecting given vertex pairs over a stochastic metric graph, each vertex of which has a probability of presence independently of all other ver
COMPGEOM
2006
ACM
15 years 3 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
2004
ACM
15 years 3 months ago
2004
ACM
Let B be a set of n unit balls in R3 . We show that the combinatorial complexity of the space of lines in R3 that avoid all the balls of B is O(n3+ε ), for any ε > 0. This re...
COMPGEOM
2004
ACM
15 years 3 months ago
2004
ACM
We prove that the geometric thickness of graphs whose maximum degree is no more than four is two. In our proofs, we present a space and time efficient embedding technique for gra...