Andranik Mirzaian

Learn More
Map labeling is of fundamental importance in cartography and geographical information systems and is one of the areas targeted for research by the ACM Computational Geometry Impact Task Force. Previous work on map labeling has focused on the problem of placing maximal uniform, axis-aligned, disjoint rectangles on the plane so that each point feature to be(More)
We consider the robot exploration problem of graph maps with homogeneous markers, following the graph world model introduced by Dudek et al. DJMW]. The environment is a graph consisting of nodes and edges, where the robot can navigate from one node to another through an edge connecting these two nodes. However, the robot may not distinguish one node (or(More)
Channel Routing is a VLSI layout problem that has received considerable attention recently. See in particular [3,S,4,7]. The main result of this paper is an O(n) time algorithm for the optimum offset problem. This improves upon the best previously known time bound of O(nlogn) [3,6]. Furthermore the constant time factor in our O(n) algorithm is much smaller(More)
A mobile robot often executes a planned path by measuring its position relative to visible landmarks at known positions and then using this information to estimate its own absolute position. The minimum number of landmarks k required for self-location depends on the types of measurements the robot can perform, such as visual angles using a video camera on a(More)