Covering a simple polygon by monotone directions
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Ahn, H.-K. | - |
dc.contributor.author | Brass, P. | - |
dc.contributor.author | Knauer, C. | - |
dc.contributor.author | Na, H.-S. | - |
dc.contributor.author | Shin, C.-S. | - |
dc.date.available | 2019-04-10T11:17:28Z | - |
dc.date.created | 2018-04-17 | - |
dc.date.issued | 2008 | - |
dc.identifier.isbn | 3540921818 | - |
dc.identifier.issn | 0302-9743 | - |
dc.identifier.uri | http://scholarworks.bwise.kr/ssu/handle/2018.sw.ssu/33579 | - |
dc.description.abstract | In this paper we study the problem of finding a set of k directions for a given simple polygon P, such that for each point p∈ ∈P there is at least one direction in which the line through p intersects the polygon only once. For k∈=∈1, this is the classical problem of finding directions in which the polygon is monotone, and all such directions can be found in linear time for a simple n-gon. For k∈>∈1, this problem becomes much harder; we give an O(n 5log2 n)-time algorithm for k∈=∈2, and O(n 3k∈+∈2)-time algorithm for k∈¥∈3. These results are the first on the generalization of the monotonicity problem. © 2008 Springer Berlin Heidelberg. | - |
dc.relation.isPartOf | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | - |
dc.title | Covering a simple polygon by monotone directions | - |
dc.type | Conference | - |
dc.identifier.doi | 10.1007/978-3-540-92182-0_59 | - |
dc.type.rims | CONF | - |
dc.identifier.bibliographicCitation | 19th International Symposium on Algorithms and Computation, ISAAC 2008, v.5369 LNCS, pp.668 - 679 | - |
dc.description.journalClass | 2 | - |
dc.identifier.scopusid | 2-s2.0-58549096763 | - |
dc.citation.conferenceDate | 2008-12-15 | - |
dc.citation.conferencePlace | Gold Coast, QLD | - |
dc.citation.endPage | 679 | - |
dc.citation.startPage | 668 | - |
dc.citation.title | 19th International Symposium on Algorithms and Computation, ISAAC 2008 | - |
dc.citation.volume | 5369 LNCS | - |
dc.contributor.affiliatedAuthor | Na, H.-S. | - |
dc.type.docType | Conference Paper | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
Soongsil University Library 369 Sangdo-Ro, Dongjak-Gu, Seoul, Korea (06978)02-820-0733
COPYRIGHT ⓒ SOONGSIL UNIVERSITY, ALL RIGHTS RESERVED.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.