947 search results - page 168 / 190 » Discrete Geometry |
75
Voted
CAAN
2004
Springer
15 years 3 months ago
2004
Springer
We study the bandwidth allocation problem Maximize U(x), subject to Ax ≤ c; x ≥ 0 where U is a utility function, x is a bandwidth allocation vector, and Ax ≤ c represent the...
CAAN
2004
Springer
15 years 3 months ago
2004
Springer
It appeared recently that the classical random graph model used to represent real-world complex networks does not capture their main properties. Since then, various attempts have ...
COMPGEOM
2003
ACM
15 years 2 months ago
2003
ACM
We introduce billboard clouds – a new approach for extreme simplification in the context of real-time rendering. 3D models are simplified onto a set of planes with texture and...
COMPGEOM
2003
ACM
15 years 2 months ago
2003
ACM
Pointed pseudo-triangulations are planar minimally rigid graphs embedded in the plane with pointed vertices (adjacent to an angle larger than π). In this paper we prove that the ...
COMPGEOM
2003
ACM
15 years 2 months ago
2003
ACM
We introduce (1/r)-cuttings for collections of surfaces in 3-space that are sensitive to an additional collection of curves. Specifically, let S be a set of n surfaces in R3 of c...