501 search results - page 4 / 101 » An Upper Bound on the Number of Rectangulations of a Point S... |
CCCG
2006
13 years 9 months ago
2006
In their paper on delineating boundaries from geographic data, Reinbacher et al. [9] use a recolouring method to reclassify points so that the boundaries that separate points of d...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
This paper develops upper bounds on the end-to-end transmission capacity of multi-hop wireless networks. Potential source-destination paths are dynamically selected from a pool of...
COMGEO
2004
ACM
13 years 7 months ago
2004
ACM
We show that the number of straight-edge triangulations exhibited by any set of n points in general position in the plane is bounded from below by (2.33n). 2004 Elsevier B.V. All ...
COMPGEOM
2010
ACM
14 years 17 days ago
2010
ACM
We study the expected number of interior vertices of degree i in a triangulation of a point set S, drawn uniformly at random from the set of all triangulations of S, and derive va...
COMBINATORICS
2006
13 years 7 months ago
2006
A d-dimensional hypercube drawing of a graph represents the vertices by distinct points in {0, 1}d, such that the line-segments representing the edges do not cross. We study lower...