Three-Dimensional Digital Line Segments

DOI10.1109/TPAMI.1983.4767379zbMath0513.68075OpenAlexW2078746337WikidataQ39996091 ScholiaQ39996091MaRDI QIDQ3659177

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

convex hulldigital convexitychord propertydigital arcs3-D digital pictures

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Related Items (8)

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

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