DC Field | Value | Language |
---|---|---|
dc.contributor.author | Dhandapani, R | ko |
dc.contributor.author | Goodman, JE | ko |
dc.contributor.author | Holmsen, Andreas F | ko |
dc.contributor.author | Pollack, R | ko |
dc.contributor.author | Smorodinsky, S | ko |
dc.date.accessioned | 2013-03-06T22:31:37Z | - |
dc.date.available | 2013-03-06T22:31:37Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 2007-09 | - |
dc.identifier.citation | DISCRETE COMPUTATIONAL GEOMETRY, v.38, no.2, pp.243 - 257 | - |
dc.identifier.issn | 0179-5376 | - |
dc.identifier.uri | http://hdl.handle.net/10203/88694 | - |
dc.description.abstract | We extend to topological affine planes the standard theorems of convexity, among them the separation theorem, the anti-exchange theorem, Radon's, Helly's, Caratheodory's, and Kirchberger's theorems, and the Minkowski theorem on extreme points. In a few cases the proofs are obtained by adapting proofs of the original results in the Euclidean plane; in others it is necessary to devise new proofs that are valid in the more general setting considered here. | - |
dc.language | English | - |
dc.publisher | SPRINGER | - |
dc.subject | ARRANGEMENTS | - |
dc.title | Convexity in topological affine planes | - |
dc.type | Article | - |
dc.identifier.wosid | 000248577600006 | - |
dc.identifier.scopusid | 2-s2.0-37249082074 | - |
dc.type.rims | ART | - |
dc.citation.volume | 38 | - |
dc.citation.issue | 2 | - |
dc.citation.beginningpage | 243 | - |
dc.citation.endingpage | 257 | - |
dc.citation.publicationname | DISCRETE COMPUTATIONAL GEOMETRY | - |
dc.identifier.doi | 10.1007/s00454-007-1336-5 | - |
dc.contributor.localauthor | Holmsen, Andreas F | - |
dc.contributor.nonIdAuthor | Dhandapani, R | - |
dc.contributor.nonIdAuthor | Goodman, JE | - |
dc.contributor.nonIdAuthor | Pollack, R | - |
dc.contributor.nonIdAuthor | Smorodinsky, S | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordPlus | ARRANGEMENTS | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.