By Topic

An efficient method for computing the feasible region with translational containment between two convex polygons

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
3 Author(s)
Yu-Kumg Chen ; Dept. of Electron. Eng., Huafan Univ., Taiwan ; Shuo-Yan Chou ; Tzong-Chen Wu

A convex polygon containment problem is studied: whether a given convex polygon P can be translated to fit inside another fixed convex polygon Q. An O(pq log q) time algorithm is presented for solving such a problem, where p and q are the numbers of vertices of P and Q. In addition, by utilizing the existence algorithm, it takes O(pq log q) time to find the set of all placements of P that fit inside Q

Published in:

Distributed Computing Systems Workshop, 2001 International Conference on

Date of Conference:

Apr 2001