ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Optimal polygon placement by translation

Pal, SP and Dasgupta, B and Madhavan, CEV (1994) Optimal polygon placement by translation. In: International Journal of Computer Mathematics, 52 (3-4). 139-148 .

Full text not available from this repository. (Request a copy)
Official URL: http://www.informaworld.com/smpp/content~db=all~co...


Let M be an m-sided simple polygon and N be an n-sided polygon with holes. In this paper we consider the problem of computing the feasible region, i.e., the set of all placements by translation of M so that M lies inside N without intersecting any hole. First we propose an O (mn(2)) time algorithm for computing the feasible region for the case when M is a monotone polygon. Then we consider the general case when M is a simple polygon and propose an O(m(2)n(2)) time algorithm for computing the feasible region. Both algorithms are optimal upto a constant factor.

Item Type: Journal Article
Publication: International Journal of Computer Mathematics
Publisher: Taylor and francis group
Additional Information: Copyright of this article belongs to Taylor and francis group.
Department/Centre: Division of Electrical Sciences > Computer Science & Automation
Date Deposited: 08 Apr 2011 08:52
Last Modified: 08 Apr 2011 08:52
URI: http://eprints.iisc.ac.in/id/eprint/36666

Actions (login required)

View Item View Item