On computing connected components of line segments

DOI10.1109/12.376174MaRDI QIDQ4419685zbMATH OpenOpenAlexFDO

Authors Mario A. Lopez, Ramakrishna Thurimella

Publication date 1995

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/50da15f6588fa97264f70e52f10fc40ec761650a

zbMATH Keywords

Hopcroft's problem

Mathematics Subject Classification ID

Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Recommendations

• Connected component and simple polygon intersection searching
• Connected component and simple polygon intersection searching
• Computing a Face in an Arrangement of Line Segments and Related Problems
• Intersecting Line Segments in Parallel with an Output-Sensitive Number of Processors
• An optimal algorithm for intersecting line segments in the plane

Cited in

(4)

• Hide-and-seek: algorithms for polygon walk problems
• On sets of line segments featuring a cactus structure
• Computing simple circuits from a set of line segments
• Hopcroft's problem, log* shaving, two-dimensional fractional cascading, and decision trees

This page was built for publication: On computing connected components of line segments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4419685)