Korean Journal of Computational Design and Engineering (한국CDE학회논문집)

Society for Computational Design and Engineering (한국CDE학회)
권호 표지

An efficient polygonal chian inersection algorithm

점열 곡선의 꼬임을 효율적으로 찾는 알고리즘

  • Published : 1999.09.01
Download PDF
⟨ Previous Next ⟩

Abstract

Presented in this paper is an algorithm for finding all intersections among polygonal chains with an O((n+k)·log m) worst-case time complexity, where n is the number of lien 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 sweep line algorithm. 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 and singularities (tangential contact, multiple intersections). The algorithms has been implemented and applied to 1) testing simplicity of a polygon, 2) finding intersections among polygons and 3) offsetting planar point-sequence curves.

Keywords

References

  1. Proc. 17th Annu. Conf. Foundation of Computer Science Geometric intersection problems Shamos, M.I.;Hoey, D.J.
  2. IEEE Transactions on Computers v.28 Algorithms for reporting and counting geometric intersections Bentley, J.L.;Ottmann, T.A.
  3. Computationalgeometry-An introduction Preparata, F.P.;Shamos, M.I.
  4. Journal of the Association for computing machinery v.39 no.1 An Optimal algorithm for intersecting line segments in the plane Chazellem B.;Edelsbrunner, H.
  5. Communications of the ACM v.25 no.10 Plane-sweep algorithms for intersecting geometric figures Nievergelt, J.;Preparata, E.P.
  6. Information processing letters v.14 no.2 Polygonal intersection searching Edelsbrunner, H.;Maurer, H.A.
  7. IEEE Trans. Comput. v.C-30 An Optimal worst-case algorithm for reporting intersections of rectangles Bentley, J.L.;Wood, D.
  8. Information Processing Letters v.37 no.4 The intersection searching problem for c-oriented polygons Xue-Hou Tan;Tomio Hirata;Yasuyoshi Inagaki
  9. Proc. 6th Canad. Conf. Comput. Geom. Trapezoid Sweep Algorithm for Reporting Red/Blue Segment Intersections Chan, T.M.;Simple, A.
  10. The Visual Computer v.7 A geometry-based investigation of the tool path generation for zigzag pocket machining Held, M.
  11. ACM Transactions on graphics v.11 no.2 An algorithm for generation NC tool paths for arbitrary shaped pockets with island Allan Hansen;Farhad Arbab