Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!mnetor!seismo!lll-crg!nike!sri-spam!parcvax!hplabs!hp-sdd!nick
From: nick@hp-sdd.UUCP (Nick Flor)
Newsgroups: net.graphics
Subject: Intersecting lines
Message-ID: <445@hp-sdd.UUCP>
Date: Mon, 22-Sep-86 17:17:37 EDT
Article-I.D.: hp-sdd.445
Posted: Mon Sep 22 17:17:37 1986
Date-Received: Tue, 23-Sep-86 23:05:46 EDT
Distribution: net
Organization: Hewlett Packard, San Diego
Lines: 20

Does anyone out there have a good algorithm for determining if a polygon
line segment intersects another line segment in the same polygon?
(Besides the O(n^2) one where you calculate the intersection of the
 line segment with each segment in the polygon)

Thanks in advance.


Nick
-- 
Standard disclaimer:  
  The above opinions are my own and do not necessarily reflect those of my 
  employers.

Nick V. Flor -- This is just another permutation of sh*t.
..hplabs!hp-sdd!nick

"What's going down in this world, you got no idea.  Believe me."

The Comedian