File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Efficient algorithm for transversal of disjoint convex polygons

TitleEfficient algorithm for transversal of disjoint convex polygons
Authors
KeywordsComputational Geometry
Disjoint Convex Polygon
Stabber
Transversal
Issue Date2002
PublisherElsevier 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?
AbstractAn 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 Identifierhttp://hdl.handle.net/10722/152292
ISSN
2015 Impact Factor: 0.605
2015 SCImago Journal Rankings: 0.698
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorChin, FYLen_US
dc.contributor.authorWang, FLen_US
dc.date.accessioned2012-06-26T06:36:59Z-
dc.date.available2012-06-26T06:36:59Z-
dc.date.issued2002en_US
dc.identifier.citationInformation Processing Letters, 2002, v. 83 n. 3, p. 141-144en_US
dc.identifier.issn0020-0190en_US
dc.identifier.urihttp://hdl.handle.net/10722/152292-
dc.description.abstractAn 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.languageengen_US
dc.publisherElsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/iplen_US
dc.relation.ispartofInformation Processing Lettersen_US
dc.subjectComputational Geometryen_US
dc.subjectDisjoint Convex Polygonen_US
dc.subjectStabberen_US
dc.subjectTransversalen_US
dc.titleEfficient algorithm for transversal of disjoint convex polygonsen_US
dc.typeArticleen_US
dc.identifier.emailChin, FYL:chin@cs.hku.hken_US
dc.identifier.authorityChin, FYL=rp00105en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.doi10.1016/S0020-0190(01)00322-2en_US
dc.identifier.scopuseid_2-s2.0-0037119064en_US
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-0037119064&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volume83en_US
dc.identifier.issue3en_US
dc.identifier.spage141en_US
dc.identifier.epage144en_US
dc.identifier.isiWOS:000176162700004-
dc.publisher.placeNetherlandsen_US
dc.identifier.scopusauthoridChin, FYL=7005101915en_US
dc.identifier.scopusauthoridWang, FL=7501312845en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats