dc.citation.conferencePlace |
CL |
- |
dc.citation.conferencePlace |
Valdivi |
- |
dc.citation.endPage |
478 |
- |
dc.citation.startPage |
467 |
- |
dc.citation.title |
LATIN 2006: Theoretical Informatics - 7th Latin American Symposium |
- |
dc.contributor.author |
Fournier, Herve |
- |
dc.contributor.author |
Vigneron, Antoine |
- |
dc.date.accessioned |
2023-12-20T05:09:48Z |
- |
dc.date.available |
2023-12-20T05:09:48Z |
- |
dc.date.created |
2016-07-04 |
- |
dc.date.issued |
2006-03-20 |
- |
dc.description.abstract |
The diameter of a set P of n points in RdRd 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 Ω(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 R3R3 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 R2R2 to the diameter problem for a point set in R7R7. |
- |
dc.identifier.bibliographicCitation |
LATIN 2006: Theoretical Informatics - 7th Latin American Symposium, pp.467 - 478 |
- |
dc.identifier.doi |
10.1007/11682462_44 |
- |
dc.identifier.scopusid |
2-s2.0-33745611110 |
- |
dc.identifier.uri |
https://scholarworks.unist.ac.kr/handle/201301/34488 |
- |
dc.identifier.url |
http://link.springer.com/chapter/10.1007%2F11682462_44 |
- |
dc.language |
영어 |
- |
dc.publisher |
LATIN 2006: Theoretical Informatics - 7th Latin American Symposium |
- |
dc.title |
Lower bounds for geometric diameter problems |
- |
dc.type |
Conference Paper |
- |
dc.date.conferenceDate |
2006-03-20 |
- |