Line segmentation of digital curves in parallel

DOI10.1007/3-540-59042-0_103MaRDI QIDQ4596651zbMATH OpenOpenAlexFDO

Authors Peter Damaschke

Publication date 4 December 2017

Published in STACS 95 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-59042-0_103

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10) Analysis of algorithms (68W40)

Recommendations

• An optimal parallel algorithm for digital curve segmentation
• Parallel algorithm for corner finding on digital curves
• scientific article; zbMATH DE number 1279837
• Digitalizing line segments
• scientific article; zbMATH DE number 4016245
• Fast Polynomial Segmentation of Digitized Curves
• Linear segmentation of discrete curves into blurred segments
• An optimal parallel algorithm for digital curve segmentation using hough polygons and monotone function search

Cited in

(11)

• An optimal parallel algorithm for digital curve segmentation
• Constructing Consistent Digital Line Segments
• Computing the Characteristics of a SubSegment of a Digital Straight Line in Logarithmic Time
• Algorithms for Fast Digital Straight Segments Union
• scientific article; zbMATH DE number 4211509 (Why is no real title available?)
• Chord properties of digital straight line segments
• scientific article; zbMATH DE number 4057076 (Why is no real title available?)
• Parallel algorithm for corner finding on digital curves
• Fast Polynomial Segmentation of Digitized Curves
• An optimal parallel algorithm for digital curve segmentation using hough polygons and monotone function search
• Searching for a monotone function by independent threshold queries

This page was built for publication: Line segmentation of digital curves in parallel

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