584 search results - page 39 / 117 » On the Number of Halving Planes |
GD
2006
Springer
15 years 1 months ago
2006
Springer
We prove that computing a geometric minimum-dilation graph on a given set of points in the plane, using not more than a given number of edges, is an NP-hard problem, no matter if ...
COMPGEOM
2008
ACM
14 years 11 months ago
2008
ACM
We present a kinetic data structure for maintaining a (1+ )-spanner of size O(n/2 ) for a set of n moving points in the plane. Assuming the trajectories of the points can be descr...
FCS
2006
14 years 11 months ago
2006
In this paper, we concentrate on the problem of computing a Voronoi diagram using Hypercube model of computation. The main contribution of this work is the O(log3 n) parallel algor...
DCG
2010
14 years 10 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...
ARSCOM
2006
14 years 10 months ago
2006
ABSTRACT. The Levi graph of a balanced incomplete block design is the bipartite graph whose vertices are the points and blocks of the design, with each block adjacent to those poin...