1672 search results - page 104 / 335 » Tightness problems in the plane |
IJCGA
2007
14 years 11 months ago
2007
Given a set of n points in the plane, we consider the problem of computing the circular ordering of the points about a viewpoint q and efficiently maintaining this ordering inform...
FOCS
2010
IEEE
14 years 9 months ago
2010
IEEE
We show that the minimum possible size of an -net for point objects and line (or rectangle)ranges in the plane is (slightly) bigger than linear in 1/ . This settles a problem rais...
MMAS
2010
Springer
14 years 5 months ago
2010
Springer
This article is devoted to the asymptotic analysis of the electromagnetic fields scattered by a perfectly conducting plane containing two sub-wavelength rectangular cavities. The p...
102
click to vote
GC
2011
Springer
14 years 2 months ago
2011
Springer
The minimum clique partition (MCP) problem is that of partitioning the vertex set of a given graph into a minimum number of cliques. Given n points in the plane, the corresponding...
143
click to vote
APPROX
2006
Springer
15 years 2 months ago
2006
Springer
For a given graph with weighted vertices, the goal of the minimum-weight dominating set problem is to compute a vertex subset of smallest weight such that each vertex of the graph...