Black History Month is here! Discover ERA research focused on Black experiences in Canada and worldwide. Use our general search below to get started!

Intersection and minimum distance problems for planer polygons

dc.contributor.authorWang, Cao An
dc.date.accessioned2025-05-29T11:04:00Z
dc.date.available2025-05-29T11:04:00Z
dc.date.issued1983
dc.identifier.doihttps://doi.org/10.7939/r3-39mx-3g74
dc.language.isoen
dc.rightsThis thesis is made available by the University of Alberta Libraries with permission of the copyright owner solely for the purpose of private, scholarly or scientific research. This thesis, or any portion thereof, may not otherwise be copied or reproduced without the written consent of the copyright owner, except to the extent permitted by Canadian copyright law.
dc.subjectConvex geometry. Data processing.
dc.subjectPolygons. Data processing.
dc.titleIntersection and minimum distance problems for planer polygons
dc.typehttp://purl.org/coar/resource_type/c_46ec
thesis.degree.grantorhttp://id.loc.gov/authorities/names/n79058482
thesis.degree.levelMaster's
thesis.degree.nameMaster of Science
ual.date.graduation1983
ual.departmentDepartment of Computing Science
ual.jupiterAccesshttp://terms.library.ualberta.ca/public

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
ML26846.pdf
Size:
2.66 MB
Format:
Adobe Portable Document Format