|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
Optimal Algorithms for the Intersection and the Minimum Distance Problems Between Planar Polygons
December 1983 (vol. 32 no. 12)
pp. 1203-1207
| ASCII Text | x | ||
| F. Chin, null Cao An Wang, "Optimal Algorithms for the Intersection and the Minimum Distance Problems Between Planar Polygons," IEEE Transactions on Computers, vol. 32, no. 12, pp. 1203-1207, December, 1983. | |||
| BibTex | x | ||
| @article{ 10.1109/TC.1983.1676186, author = {F. Chin and null Cao An Wang}, title = {Optimal Algorithms for the Intersection and the Minimum Distance Problems Between Planar Polygons}, journal ={IEEE Transactions on Computers}, volume = {32}, number = {12}, issn = {0018-9340}, year = {1983}, pages = {1203-1207}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.1983.1676186}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - Optimal Algorithms for the Intersection and the Minimum Distance Problems Between Planar Polygons IS - 12 SN - 0018-9340 SP1203 EP1207 EPD - 1203-1207 A1 - F. Chin, A1 - null Cao An Wang, PY - 1983 KW - unimodal KW - Computation geometry KW - convex polygon KW - minimum distance KW - nonconvex polygon KW - planar polygon KW - polygon intersection VL - 32 JA - IEEE Transactions on Computers ER - | |||
Two planar geometric problems relating to a convex n-gon P and a simple nonconvex m-gon Q are considered.
Index Terms:
unimodal, Computation geometry, convex polygon, minimum distance, nonconvex polygon, planar polygon, polygon intersection
Citation:
F. Chin, null Cao An Wang, "Optimal Algorithms for the Intersection and the Minimum Distance Problems Between Planar Polygons," IEEE Transactions on Computers, vol. 32, no. 12, pp. 1203-1207, Dec. 1983, doi:10.1109/TC.1983.1676186
Usage of this product signifies your acceptance of the Terms of Use.