By Topic

On computing connected components of line segments

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
M. A. Lopez ; Dept. of Math. & Comput. Sci., Denver Univ., CO, USA ; R. Thurimella

It is shown that given a set of n line segments, their connected components can be computed in time O(n4/3log3n). A bound of o(n4/3) for this problem would imply a similar bound for detecting, for a given set of n points and n lines, whether some point lies on some of the lines. This problem, known as Hopcroft's problem, is believed to have a lower bound of Ω(n4/3). For the special case when for each segment both endpoints fall inside the same face of the arrangement induced by the set of segments, we give an algorithm that runs in O(nlog3n) time

Published in:

IEEE Transactions on Computers  (Volume:44 ,  Issue: 4 )