View Item 

Show simple item record

Finding the convex hull of a simple polygon in linear time

dc.contributor.authorShin, Sung Yongen_US
dc.contributor.authorWoo, Tony C.en_US
dc.date.accessioned2006-04-07T19:40:01Z
dc.date.available2006-04-07T19:40:01Z
dc.date.issued1986en_US
dc.identifier.citationShin, S. Y., Woo, T. C. (1986)."Finding the convex hull of a simple polygon in linear time." Pattern Recognition 19(6): 453-458. <http://hdl.handle.net/2027.42/26420>en_US
dc.identifier.urihttp://www.sciencedirect.com/science/article/B6V14-48MPKB6-PT/2/8a468dfd9b127144510f7b2bbdf69b18en_US
dc.identifier.urihttps://hdl.handle.net/2027.42/26420
dc.description.abstractThough linear algorithms for finding the convex hull of a simply-connected polygon have been reported, not all are short and correct. A compact version based on Sklansky's original idea(7) and Bykat's counter-example(8) is given. Its complexity and correctness are also shown.en_US
dc.format.extent415057 bytes
dc.format.extent3118 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypetext/plain
dc.language.isoen_US
dc.publisherElsevieren_US
dc.titleFinding the convex hull of a simple polygon in linear timeen_US
dc.typeArticleen_US
dc.rights.robotsIndexNoFollowen_US
dc.subject.hlbsecondlevelScience (General)en_US
dc.subject.hlbsecondlevelComputer Scienceen_US
dc.subject.hlbtoplevelScienceen_US
dc.subject.hlbtoplevelEngineeringen_US
dc.description.peerreviewedPeer Revieweden_US
dc.contributor.affiliationumDepartment of Industrial and Operations Engineering, The University of Michigan, Ann Arbor, MI 48109, U.S.A.en_US
dc.contributor.affiliationumDepartment of Industrial and Operations Engineering, The University of Michigan, Ann Arbor, MI 48109, U.S.A.en_US
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/26420/1/0000507.pdfen_US
dc.identifier.doihttp://dx.doi.org/10.1016/0031-3203(86)90043-9en_US
dc.identifier.sourcePattern Recognitionen_US
dc.owningcollnameInterdisciplinary and Peer-Reviewed


Files in this item

Name:
0000507.pdf
Size:
405.3KB
Format:
PDF
View/Open

Show simple item record

Remediation of Harmful Language

The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information 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.