584 search results - page 67 / 117 » On the Number of Halving Planes |
COMGEO
2006
ACM
14 years 10 months ago
2006
ACM
We consider combinatorial and computational issues that are related to the problem of moving coins from one configuration to another. Coins are defined as non-overlapping discs, an...
JAR
2008
14 years 10 months ago
2008
Abstract. We propose to combine interactive proof construction with proof automation for a fragment of first-order logic called Coherent Logic (CL). CL allows enough existential qu...
JFR
2008
14 years 10 months ago
2008
The usability of mobile robots for surveillance, search and rescue missions can be significantly improved by intelligent functionalities decreasing the cognitive load on the opera...
106
click to vote
SIAMCOMP
2008
14 years 10 months ago
2008
We consider the rooted orienteering problem: Given a set P of n points in the plane, a starting point r P, and a length constraint B, one needs to find a path starting from r tha...
IPL
2007
14 years 9 months ago
2007
The disk dimension of a planar graph G is the least number k for which G embeds in the plane minus k open disks, with every vertex on the boundary of some disk. Useful properties ...