DGCI
2006
Springer
15 years 23 days ago
2006
Springer
This paper explores proofs of the isoperimetric inequality for 4-connected shapes on the integer grid Z2 , and its geometric meaning. Pictorially, we discuss ways to place a maxima...
COMPGEOM
2006
ACM
15 years 23 days ago
2006
ACM
We prove that any collection of n discs in which each one intersects at most k others, can be colored with at most O(log3 k) colors so that for each point p in the union of all di...
COMPGEOM
2006
ACM
15 years 24 days ago
2006
ACM
COMPGEOM
2006
ACM
15 years 24 days ago
2006
ACM
I present an algorithm that can provably eliminate slivers in the interior of a tetrahedral mesh, leaving only tetrahedra with dihedral angles between 30 and 135 degrees and radiu...
COMPGEOM
2006
ACM
15 years 24 days ago
2006
ACM
COMPGEOM
2006
ACM
15 years 24 days ago
2006
ACM
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...
CAAN
2006
Springer
15 years 24 days ago
2006
Springer
Gossiping is a communication primitive where each node of a network possesses a unique message that is to be communicated to all other nodes in the network. We study the gossiping ...
CAAN
2006
Springer
15 years 24 days ago
2006
Springer
In this paper we improve the quality of a recently suggested class of construction heuristics for the Asymmetric Traveling Salesman Problem (ATSP), namely the Contract-or-Patch heu...
CAAN
2006
Springer
15 years 24 days ago
2006
Springer
We consider scheduling problems that are motivated by an optimization of the transmission schedule of a smart antenna. In these problems we are given a set of messages and a confl...
CAAN
2006
Springer
15 years 24 days ago
2006
Springer
We consider the problem of finding a short path between any two nodes of a network when no global information is available, nor any oracle to help in routing. A mobile agent, situa...