Algorithms for Fast Digital Straight Segments Union

DOI10.1007/978-3-319-09955-2_29MaRDI QIDQ3190094zbMATH OpenOpenAlexFDO

Authors Isabelle Sivignon

Publication date 15 September 2014

Published in Discrete Geometry for Computer Imagery (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-09955-2_29

zbMATH Keywords

digital geometrydigital straight segmentunion

Mathematics Subject Classification ID

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

Recommendations

• Two efficient algorithms for computing the characteristics of a subsegment of a digital straight line
• An optimal parallel algorithm for digital curve segmentation
• Fast recognition of a digital straight line subsegment: two algorithms of logarithmic time complexity
• An elementary algorithm for digital arc segmentation
• An elementary algorithm for digital arc segmentation
• An algorithm for segment approximation
• Line segmentation of digital curves in parallel
• Computing the Characteristics of a SubSegment of a Digital Straight Line in Logarithmic Time

Cited in

(1)

• Fast recognition of a digital straight line subsegment: two algorithms of logarithmic time complexity

This page was built for publication: Algorithms for Fast Digital Straight Segments Union

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