Towards the computation of the convex hull of a configuration from its corresponding separating matrix

Simple item page
dc.creatorFeder, Elie
dc.creatorGarber, David
dc.date2007-09-17
dc.date.accessioned2026-07-07T08:29:58Z
dc.date.available2026-07-07T08:29:58Z
dc.descriptionIn this paper, we cope with the following problem: compute the size of the convex hull of a configuration C, where the given data is the number of separating lines between any two points of the configuration (where the lines are generated by pairs of other points of the configuration). We give an algorithm for the case that the convex hull is of size 3, and a partial algorithm and some directions for the case that the convex hull is of size bigger than 3.
dc.description10 pages, 3 figures; To appear in the Australasian Journal of Combinatorics
dc.identifierhttps://arxiv.org/abs/0709.2555
dc.identifierhttp://arxiv.org/abs/0709.2555
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/138128
dc.subjectCombinatorics
dc.subject05B30, 52C35
dc.titleTowards the computation of the convex hull of a configuration from its corresponding separating matrix
dc.typetext

Files

Collections

arXiv