We describe algorithmic results on two crucial aspects of allocating resources on computational hardware devices with partial reconfigurability. By using methods from the field of computational geometry, we derive a method that allows correct maintenance of free and occupied space of a set of n rectangular modules in time O(n\log n); previous approaches needed a time of O(n^{2}) for correct results and O(n) for heuristic results. We also show a matching lower bound of \Omega(n\log n), so our approach is optimal. We also show that finding an optimal feasible communication-conscious placement (which minimizes the total weighted Manhattan distance between the new module and existing demand points) can be computed with \Theta(n\log n). Both resulting algorithms are practically easy to implement and show convincing experimental behavior.