839 search results - page 26 / 168 » Three-Clustering of Points in the Plane |
169
click to vote
DCG
2010
15 years 6 months ago
2010
This paper shows that any planar graph with n vertices can be point-set embedded with at most one bend per edge on a universal set of n points in the plane. An implication of this...
163
click to vote
COMGEO
2004
ACM
15 years 6 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 ...
153
click to vote
TSP
2010
15 years 23 days ago
2010
This paper proposes a new estimation procedure for the ambiguity function of a non-stationary time series. The stochastic properties of the empirical ambiguity function calculated...
176
click to vote
GD
2001
Springer
15 years 10 months ago
2001
Springer
In an orthogonal drawing of a plane graph each vertex is drawn as a point and each edge is drawn as a sequence of vertical and horizontal line segments. A bend is a point at which...
159
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Map vertices of a graph to (not necessarily distinct) points of the plane so that two adjacent vertices are mapped at least a unit distance apart. The plane-width of a graph is th...