Three-Dimensional Digital Line Segments

DOI10.1109/TPAMI.1983.4767379MaRDI QIDQ3659177zbMATH OpenOpenAlexWikidataFDO

Authors Chul Eung Kim

Publication date 1983

Published in IEEE Transactions on Pattern Analysis and Machine Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tpami.1983.4767379

zbMATH Keywords

3-D digital pictureschord propertyconvex hulldigital arcsdigital convexity

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Cited in

(8)

• Computing convexity properties of images on a pyramid computer
• A formal language approach for a 3D curve representation.
• Optimal conditions for connectedness of discretized sets
• Covering a Euclidean line or hyperplane by dilations of its discretization
• Minimal Offsets That Guarantee Maximal or Minimal Connectivity of Digital Curves in nD
• A study on the properties of 3D digital straight line segments
• A new relative chain code in 3D
• The supercover of an \(m\)-flat is a discrete analytical object

This page was built for publication: Three-Dimensional Digital Line Segments

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