Par S C,Shin H,Choi B K. A sweep line algorithm for polygonal chain intersection and its applications[J].Proceeding of IFIP WG5 2 GEO-6 Conference in Tokyo University,Dcecmber,1998,(09):187-195.Park SC, Shin H, Choi BK. A sweep line algorithm for polygonal chain intersection and its...
4021 which takes O() 1/16); refining these chains to paths may require finding all longest paths again (O(l V16)) using a modification of the shortest paths algorithm. Consequently, the following result has been proved. Corollary 5. Let G be a finite connected directed acyclic graph. ...
We present a plane-sweep algorithm which finds a closest pair with respect to any L P -metric, 1≤p≤∞, for planar configurations consisting of n (possibly intersecting) compact convex objects such as line segments, circular discs and convex polygons. For configurations of line segments or ...