48 search results - page 6 / 10 » Plane and Planarity Thresholds for Random Geometric Graphs |
165
click to vote
COMPGEOM
2007
ACM
15 years 10 months ago
2007
ACM
We show how to embed a 3-connected planar graph with n vertices as a 3-polytope with small integer coordinates. The coordinates are bounded by O(27.55n ). The crucial part is the ...
158
click to vote
ESA
2003
Springer
15 years 11 months ago
2003
Springer
This paper presents a dynamic algorithm for the construction of the Euclidean Voronoi diagram of a set of convex objects in the plane. We consider first the Voronoi diagram of smo...
224
click to vote
ICCV
2009
IEEE
16 years 11 months ago
2009
IEEE
We present a novel multi-view stereo method designed
for image-based rendering that generates piecewise planar
depth maps from an unordered collection of photographs.
First a di...
172
click to vote
MSWIM
2004
ACM
15 years 11 months ago
2004
ACM
This study addresses the problem of k-connectivity of a wireless multihop network consisting of randomly placed nodes with a common transmission range, by utilizing empirical regr...
192
click to vote
SIAMDM
2010
15 years 23 days ago
2010
Abstract. Squaregraphs were originally defined as finite plane graphs in which all inner faces are quadrilaterals (i.e., 4-cycles) and all inner vertices (i.e., the vertices not in...