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-02-03T17:27:31Z
dc.date.available2006-02-03T17:27:31Z
dc.date.issued1985en_US
dc.identifierUMR4565en_US
dc.identifier.urihttps://hdl.handle.net/2027.42/7588
dc.format.extent24 bytes
dc.format.extent19412 bytes
dc.format.extent3366 bytes
dc.format.extent23177 bytes
dc.format.extent953434 bytes
dc.format.mimetypetext/plain
dc.format.mimetypetext/plain
dc.format.mimetypetext/plain
dc.format.mimetypetext/plain
dc.format.mimetypeapplication/pdf
dc.language.isoen_USen_US
dc.subjectPolygons.en_US
dc.subjectAlgorithms.en_US
dc.subjectConvex domains.en_US
dc.subjectGeometry -- Data processing.en_US
dc.subjectLinear time invariant systems.en_US
dc.titleFinding the convex hull of a simple polygon in linear timeen_US
dc.typeTechnical Reporten_US
dc.subject.hlbtoplevelEngineeringen_US
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/7588/5/bam3301.0001.001.pdfen_US
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/7588/4/bam3301.0001.001.txten_US
dc.owningcollnameEngineering, College of - Technical Reports


Files in this item

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.