File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1016/S0020-0190(01)00322-2
- Scopus: eid_2-s2.0-0037119064
- WOS: WOS:000176162700004
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Efficient algorithm for transversal of disjoint convex polygons
| Title | Efficient algorithm for transversal of disjoint convex polygons |
|---|---|
| Authors | |
| Keywords | Computational Geometry Disjoint Convex Polygon Stabber Transversal |
| Issue Date | 2002 |
| Publisher | Elsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/ipl |
| Citation | Information Processing Letters, 2002, v. 83 n. 3, p. 141-144 How to Cite? |
| Abstract | An efficient algorithm for solving transversal of n disjoint convex polygons with a total of N vertices was discussed. A set S of n disjoint convex polygons in a plane, each with ki vertices was considered. The transversal problem was to determine whether there exists a straight line that goes through every polygon in S. Results showed that this transversal problem can be solved in O(N + nlogn) time. |
| Persistent Identifier | http://hdl.handle.net/10722/152292 |
| ISSN | 2023 Impact Factor: 0.7 2023 SCImago Journal Rankings: 0.404 |
| ISI Accession Number ID | |
| References |
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Chin, FYL | en_US |
| dc.contributor.author | Wang, FL | en_US |
| dc.date.accessioned | 2012-06-26T06:36:59Z | - |
| dc.date.available | 2012-06-26T06:36:59Z | - |
| dc.date.issued | 2002 | en_US |
| dc.identifier.citation | Information Processing Letters, 2002, v. 83 n. 3, p. 141-144 | en_US |
| dc.identifier.issn | 0020-0190 | en_US |
| dc.identifier.uri | http://hdl.handle.net/10722/152292 | - |
| dc.description.abstract | An efficient algorithm for solving transversal of n disjoint convex polygons with a total of N vertices was discussed. A set S of n disjoint convex polygons in a plane, each with ki vertices was considered. The transversal problem was to determine whether there exists a straight line that goes through every polygon in S. Results showed that this transversal problem can be solved in O(N + nlogn) time. | en_US |
| dc.language | eng | en_US |
| dc.publisher | Elsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/ipl | en_US |
| dc.relation.ispartof | Information Processing Letters | en_US |
| dc.subject | Computational Geometry | en_US |
| dc.subject | Disjoint Convex Polygon | en_US |
| dc.subject | Stabber | en_US |
| dc.subject | Transversal | en_US |
| dc.title | Efficient algorithm for transversal of disjoint convex polygons | en_US |
| dc.type | Article | en_US |
| dc.identifier.email | Chin, FYL:chin@cs.hku.hk | en_US |
| dc.identifier.authority | Chin, FYL=rp00105 | en_US |
| dc.description.nature | link_to_subscribed_fulltext | en_US |
| dc.identifier.doi | 10.1016/S0020-0190(01)00322-2 | en_US |
| dc.identifier.scopus | eid_2-s2.0-0037119064 | en_US |
| dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-0037119064&selection=ref&src=s&origin=recordpage | en_US |
| dc.identifier.volume | 83 | en_US |
| dc.identifier.issue | 3 | en_US |
| dc.identifier.spage | 141 | en_US |
| dc.identifier.epage | 144 | en_US |
| dc.identifier.isi | WOS:000176162700004 | - |
| dc.publisher.place | Netherlands | en_US |
| dc.identifier.scopusauthorid | Chin, FYL=7005101915 | en_US |
| dc.identifier.scopusauthorid | Wang, FL=7501312845 | en_US |
| dc.identifier.issnl | 0020-0190 | - |