loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
21st International Conference on Distributed Computing Systems Workshops (ICDCSW '01)
An Efficient Method for Computing the Feasible Region with Translational Containment between Two Convex Polygons
Mesa, Arizona
April 16-April 19
ISBN: 0-7695-1080-9
ASCII Text
x 
 
Yu-Kumg Chen, Shuo-Yan Chou, Tzong-Chen Wu, "An Efficient Method for Computing the Feasible Region with Translational Containment between Two Convex Polygons," Distributed Computing Systems Workshops, International Conference on, pp. 0390, 21st International Conference on Distributed Computing Systems Workshops (ICDCSW '01), 2001.
 
 
BibTex
x
 
@article{ 10.1109/CDCS.2001.918735,
author = {Yu-Kumg Chen and Shuo-Yan Chou and Tzong-Chen Wu},
title = {An Efficient Method for Computing the Feasible Region with Translational Containment between Two Convex Polygons},
journal ={Distributed Computing Systems Workshops, International Conference on},
volume = {0},
year = {2001},
isbn = {0-7695-1080-9},
pages = {0390},
doi = {http://doi.ieeecomputersociety.org/10.1109/CDCS.2001.918735},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Distributed Computing Systems Workshops, International Conference on
TI - An Efficient Method for Computing the Feasible Region with Translational Containment between Two Convex Polygons
SN - 0-7695-1080-9
SP
EP
A1 - Yu-Kumg Chen,
A1 - Shuo-Yan Chou,
A1 - Tzong-Chen Wu,
PY - 2001
VL - 0
JA - Distributed Computing Systems Workshops, International Conference on
ER -
 
Yu-Kumg Chen, Huafan University
Shuo-Yan Chou, National Taiwan University of Science and Technology
Tzong-Chen Wu, National Taiwan University of Science and Technology
Abstract: In this paper, 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.
Citation:
Yu-Kumg Chen, Shuo-Yan Chou, Tzong-Chen Wu, "An Efficient Method for Computing the Feasible Region with Translational Containment between Two Convex Polygons," icdcsw, pp.0390, 21st International Conference on Distributed Computing Systems Workshops (ICDCSW '01), 2001
Usage of this product signifies your acceptance of the Terms of Use.