Edge intersection on the hypercube computer

DOI10.1016/0020-0190(92)90169-VMaRDI QIDQ1197977zbMATH OpenOpenAlexFDO

Authors Chandrasekhar Narayanaswami, William Randolph Franklin

Publication date 16 January 1993

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(92)90169-v

zbMATH Keywords

parallel algorithmcomputational geometryperformance evaluationhypercube computerintersections of plane line segments

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Distributed algorithms (68W15)

Recommendations

• Common intersections of polygons
• Line-segment intersection reporting in parallel
• Intersecting Line Segments in Parallel with an Output-Sensitive Number of Processors
• scientific article; zbMATH DE number 1182926
• Optimal parallel hypercube algorithms for polygon problems

Cites work

• Intersecting Line Segments in Parallel with an Output-Sensitive Number of Processors
• Optimum broadcasting and personalized communication in hypercubes

Cited in

(1)

• Line-segment intersection reporting in parallel

This page was built for publication: Edge intersection on the hypercube computer

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