There are no files associated with this item.
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.citation.endPage | 257 | - |
dc.citation.number | 3 | - |
dc.citation.startPage | 245 | - |
dc.citation.title | ALGORITHMICA | - |
dc.citation.volume | 49 | - |
dc.contributor.author | Fournier, Herve | - |
dc.contributor.author | Vigneron, Antoine | - |
dc.date.accessioned | 2023-12-22T09:08:07Z | - |
dc.date.available | 2023-12-22T09:08:07Z | - |
dc.date.created | 2016-06-10 | - |
dc.date.issued | 2007-11 | - |
dc.description.abstract | The diameter of a set P of n points in R-d is the maximum Euclidean distance between any two points in P. If P is the vertex set of a 3-dimensional convex polytope, and if the combinatorial structure of this polytope is given, we prove that, in the worst case, deciding whether the diameter of P is smaller than 1 requires Omega(n log n) time in the algebraic computation tree model. It shows that the O(n log n) time algorithm of Ramos for computing the diameter of a point set in R-3 is optimal for computing the diameter of a 3-polytope. We also give a linear time reduction from Hopcroft's problem of finding an incidence between points and lines in R-2 to the diameter problem for a point set in R-7 | - |
dc.identifier.bibliographicCitation | ALGORITHMICA, v.49, no.3, pp.245 - 257 | - |
dc.identifier.doi | 10.1007/s00453-007-9010-0 | - |
dc.identifier.issn | 0178-4617 | - |
dc.identifier.scopusid | 2-s2.0-35348913283 | - |
dc.identifier.uri | https://scholarworks.unist.ac.kr/handle/201301/19657 | - |
dc.identifier.url | http://link.springer.com/article/10.1007%2Fs00453-007-9010-0 | - |
dc.identifier.wosid | 000250204400005 | - |
dc.language | 영어 | - |
dc.publisher | SPRINGER | - |
dc.title | A tight lower bound for computing the diameter of a 3D convex polytope | - |
dc.type | Article | - |
dc.description.journalRegisteredClass | scopus | - |
dc.subject.keywordAuthor | computational geometry | - |
dc.subject.keywordAuthor | lower bound | - |
dc.subject.keywordAuthor | diameter | - |
dc.subject.keywordAuthor | convex polytope | - |
dc.subject.keywordAuthor | hopcroft&apos | - |
dc.subject.keywordAuthor | s problem | - |
dc.subject.keywordPlus | POINT SET | - |
Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Tel : 052-217-1404 / Email : scholarworks@unist.ac.kr
Copyright (c) 2023 by UNIST LIBRARY. All rights reserved.
ScholarWorks@UNIST was established as an OAK Project for the National Library of Korea.