Sciweavers

5 search results - page 1 / 1
» Delaunay graphs of point sets in the plane with respect to a...
Sort
View
SODA
2008
ACM
123views Algorithms» more  SODA 2008»
13 years 11 months ago
Delaunay graphs of point sets in the plane with respect to axis-parallel rectangles
Given a point set P in the plane, the Delaunay graph with respect to axis-parallel rectangles is a graph defined on the vertex set P, whose two points p, q P are connected by an ...
Xiaomin Chen, János Pach, Mario Szegedy, G&...
CCCG
2009
13 years 11 months ago
On the Dilation of Delaunay Triangulations of Points in Convex Position
Let S be a finite set of points in the Euclidean plane, and let E be the complete graph whose point-set is S. Chew, in 1986, proved a lower bound of /2 on the stretch factor of th...
Shiliang Cui, Iyad A. Kanj, Ge Xia
CORR
2008
Springer
129views Education» more  CORR 2008»
13 years 10 months ago
On the Stretch Factor of Convex Delaunay Graphs
Let C be a compact and convex set in the plane that contains the origin in its interior, and let S be a finite set of points in the plane. The Delaunay graph DGC (S) of S is define...
Prosenjit Bose, Paz Carmi, Sébastien Collet...
COMPGEOM
2004
ACM
14 years 3 months ago
On locally Delaunay geometric graphs
A geometric graph is a simple graph G = (V, E) with an embedding of the set V in the plane such that the points that represent V are in general position. A geometric graph is said...
Rom Pinchasi, Shakhar Smorodinsky
WADS
2009
Springer
291views Algorithms» more  WADS 2009»
14 years 4 months ago
On the Power of the Semi-Separated Pair Decomposition
Abstract. A Semi-Separated Pair Decomposition (SSPD), with parameter s > 1, of a set S ⊂ Rd is a set {(Ai, Bi)} of pairs of subsets of S such that for each i, there are balls ...
Mohammad Ali Abam, Paz Carmi, Mohammad Farshi, Mic...