Output-sensitive algorithms for optimally constructing the upper envelope of straight line segments in parallel

DOI10.1016/J.JPDC.2006.12.006MaRDI QIDQ2373884zbMATH OpenOpenAlexFDO

Authors Neelima Gupta, Sumit Chopra

Publication date 16 July 2007

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jpdc.2006.12.006

zbMATH Keywords

computational geometryparallel algorithmrandomized algorithmupper envelope

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Recommendations

• scientific article; zbMATH DE number 2081104
• Upper envelope onion peeling
• Optimal, output-sensitive algorithms for constructing planar hulls in parallel
• Intersecting Line Segments in Parallel with an Output-Sensitive Number of Processors
• Finding the upper envelope of n line segments in O(n log n) time

Cited in

(6)

• Upper envelope onion peeling
• Scaleable parallel algorithms for lower envelopes with applications
• A surface mesh smoothing and untangling method independent of the CAD parameterization
• scientific article; zbMATH DE number 2081104 (Why is no real title available?)
• Planar lower envelope of monotone polygonal chains
• Upper envelope onion peeling

This page was built for publication: Output-sensitive algorithms for optimally constructing the upper envelope of straight line segments in parallel

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