501 search results - page 43 / 101 » An Upper Bound on the Number of Rectangulations of a Point S... |
ISAAC
2005
Springer
14 years 1 months ago
2005
Springer
In an orthogonal drawing of a planar graph G, each vertex is drawn as a point, each edge is drawn as a sequence of alternate horizontal and vertical line segments, and any two edge...
ECCV
2010
Springer
14 years 4 days ago
2010
Springer
Computational depth estimation is a central task in computer vision and graphics. A large variety of strategies have been introduced in the past relying on viewpoint variations, de...
COMPGEOM
2010
ACM
14 years 21 days ago
2010
ACM
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
TWC
2008
13 years 7 months ago
2008
Broadcast (or point to multipoint) communication has attracted a lot of research recently. In this paper, we consider the group broadcast channel where the users' pool is divi...
ICC
2007
IEEE
14 years 1 months ago
2007
IEEE
— We examine the Shannon limits of communication systems when the precision of the analog-to-digital conversion (ADC) at the receiver is constrained. ADC is costly and powerhungr...