A sweep line algorithm for polygonal chain intersection and its applications

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 392
  • Download : 0
Presented in this paper is a sweep-line algorithm for finding all intersections among polygonal chains with an O((n + k)-Iog m) worst-case time complexity, where n is the number of line segments in the polygonal chains, k is the number of intersections, and m is the number of monotone chains. The proposed algorithm is based on the Bentley-Ottmann's sweep line algorithm, which finds all intersections among a collection of line segments with an O((n + k)·log n) time complexity. Unlike the previous polygonal-chain intersection algorithms that are designed to handle special only cases, such as convex polygons or C-oriented polygons, the proposed algorithm can handle arbitrarily shaped polygonal chains having self-intersections. The algorithm has been implemented and applied to 1) testing simplicity of a polygon, 2) finding intersections among polygons and 3) offsetting planar point-sequence curves.
Publisher
IFIP
Issue Date
1998-12
Language
English
Citation

IFIP TC5/WG5.2 6th International Workshop on Geometric Modelling, pp.309 - 321

ISSN
1868-4238
DOI
10.1007/978-0-387-35490-3
URI
http://hdl.handle.net/10203/124257
Appears in Collection
IE-Conference Papers(학술회의논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0