Parallel algorithms for the segment dragging problem

DOI10.1016/0020-0190(90)90046-ZzbMath0706.68098OpenAlexW2088848545MaRDI QIDQ918740

Sung Kwon Kim

Publication date: 1990

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

Full work available at URL: https://doi.org/10.1016/0020-0190(90)90046-z

zbMATH Keywords

parallel algorithmscomputational geometrypointsline segmentsegment dragging

Mathematics Subject Classification ID

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

Related Items (2)

Rectilinear Steiner tree heuristics and minimum spanning tree algorithms using geographic nearest neighbors ⋮ The range co-minima problem

Cites Work

• Fractional cascading. I: A data structuring technique
• Some methods of computational geometry applied to computer graphics
• Parallel Merge Sort
• On Finding Lowest Common Ancestors: Simplification and Parallelization

This page was built for publication: Parallel algorithms for the segment dragging problem