An optimal parallel algorithm for digital curve segmentation

DOI10.1016/S0304-3975(96)00227-7zbMath0901.68081MaRDI QIDQ1391535

Peter Damaschke

Publication date: 22 July 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

EREW PRAM algorithmdigital curve segmentation

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding extrema with unary predicates
• Discrete Representation of Straight Lines
• An Efficient Parallel Biconnectivity Algorithm
• An optimal algorithm for finding all the jumps of a monotone step-function
• Representation of digital line segments and their preimages
• Linear Programming in Linear Time When the Dimension Is Fixed
• Parallel Prefix Computation
• An efficient parallel algorithm for the row minima of a totally monotone matrix
• Line segmentation of digital curves in parallel
• The linear time recognition of digital arcs

This page was built for publication: An optimal parallel algorithm for digital curve segmentation