#### Filter Results:

- Full text PDF available (10)

#### Publication Year

1984

2007

- This year (0)
- Last 5 years (0)
- Last 10 years (1)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Joseph W. H. Liu, Andranik Mirzaian
- SIAM J. Discrete Math.
- 1989

- Andranik Mirzaian
- Comput. Geom.
- 1992

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)

- Andranik Mirzaian
- Networks
- 1985

- Andranik Mirzaian
- J. Comput. Syst. Sci.
- 1987

- Andranik Mirzaian, Eshrat Arjomandi
- Inf. Process. Lett.
- 1985

- Xiaotie Deng, Andranik Mirzaian
- IEEE Trans. Robotics and Automation
- 1996

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)

- Andranik Mirzaian
- STOC
- 1984

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)

- Xiaotie Deng, Evangelos E. Milios, Andranik Mirzaian
- WADS
- 1999

In the map veriication problem, a robot is given a (possibly incorrect) map M of the world G with its position and orientation indicated on the map. The task is to nd out whether this map, for the given robot position and orientation in the map, is correct for the world G. We consider the world model with a graph G = (V G ; E G) in which, for each vertex,ā¦ (More)

- Xiaotie Deng, Evangelos E. Milios, Andranik Mirzaian
- Robotics and Autonomous Systems
- 1996

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)