View Item 

Show simple item record

On the time complexity for circumscribing a convex polygon
dc.contributor.authorWood, Tony C.en_US
dc.contributor.authorLee, Hyun-Chanen_US
dc.date.accessioned2006-04-07T19:04:24Z
dc.date.available2006-04-07T19:04:24Z
dc.date.issued1985-06en_US
dc.identifier.citationWood, Tony C., Lee, Hyun-Chan (1985/06)."On the time complexity for circumscribing a convex polygon." Computer Vision, Graphics, and Image Processing 30(3): 362-363. <http://hdl.handle.net/2027.42/25655>en_US
dc.identifier.urihttp://www.sciencedirect.com/science/article/B7GXG-4CV95NV-1C/2/ff6f62a420d5ac624c10b38d921760dcen_US
dc.identifier.urihttps://hdl.handle.net/2027.42/25655
dc.description.abstractA recent article "Circumscribing a Convex Polygon by a Polygon of Fewer Sides with Minimal Area Addition" by Dori and Ben-Bassat, Comput. Vision Graph. Image Process. 24, 1983, 131-159, raised several interesting questions including the time complexity of their algorithm. In this paper, the time complexity on circumscribing an n-gon by an m-gon, where m n, is analyzed to be O(n 1g n).en_US
dc.format.extent69240 bytes
dc.format.extent3118 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypetext/plain
dc.language.isoen_US
dc.publisherElsevieren_US
dc.titleOn the time complexity for circumscribing a convex polygonen_US
dc.typeArticleen_US
dc.rights.robotsIndexNoFollowen_US
dc.subject.hlbsecondlevelComputer Scienceen_US
dc.subject.hlbtoplevelEngineeringen_US
dc.description.peerreviewedPeer Revieweden_US
dc.contributor.affiliationumDepartment of Industrial & Operations Engineering, University of Michigan, Ann Arbor, Michigan 48109, USAen_US
dc.contributor.affiliationumDepartment of Industrial & Operations Engineering, University of Michigan, Ann Arbor, Michigan 48109, USAen_US
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/25655/1/0000207.pdfen_US
dc.identifier.doihttp://dx.doi.org/10.1016/0734-189X(85)90166-5en_US
dc.identifier.sourceComputer Vision, Graphics, and Image Processingen_US
dc.owningcollnameInterdisciplinary and Peer-Reviewed


Files in this item

Name:
0000207.pdf
Size:
67.61KB
Format:
PDF
View/Open

Show simple item record

Remediation of Harmful Language

The University of Michigan Library aims to describe its collections in a way that respects the people and communities who create, use, and are represented in them. We encourage you to Contact Us anonymously if you encounter harmful or problematic language in catalog records or finding aids. More information about our policies and practices is available at Remediation of Harmful Language.

Accessibility

If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.