Polygon Convexity: A Minimal O(n) Test

Simple item page
dc.creatorPinelis, Iosif
dc.date2006-09-25
dc.date.accessioned2026-07-07T07:23:57Z
dc.date.available2026-07-07T07:23:57Z
dc.descriptionAn O(n) test for polygon convexity is stated and proved. It is also proved that the test is minimal in a certain exact sense.
dc.description14 pages
dc.identifierhttps://arxiv.org/abs/cs/0609141
dc.identifierhttp://arxiv.org/abs/cs/0609141
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/116175
dc.subjectComputational Geometry
dc.subjectComputational Complexity
dc.subjectCombinatorics
dc.subjectMetric Geometry
dc.subjectI.3.5; F.2.2; G.2.1; G.2.2
dc.titlePolygon Convexity: A Minimal O(n) Test
dc.typetext

Files

Collections

arXiv