Grid intersect quantization schemes for solid object digitization

✍ Scribed by P.V. Sankar

• Publisher: Elsevier Science
• Year: 1978
• Weight: 642 KB
• Volume: 8
• Category: Article
• ISSN: 0146-664X
• DOI: 10.1016/s0146-664x(78)80029-x

✦ Synopsis

Two simple grid intersect quantization schemes h~r digitizing solid objects are described. These algorithms map the closed boundary curve of I;he solid objecb into a regular sequence of fern'-connected domains ~ ml lhe digital plane. The digitization sequence .'D is associated wi01 ~ pseudodigital curve S, consisting of the centers (which are not. lattice points) of the domains in ~. II is shown ~;ha{ any subset S~ of S, namely, a pseudoarc, is the digitization of a st.raighl; line segment c~l' the MPP (minimum perimeter polygon of 'D), it' m~d only if it. satisfies an extended "chord property": the line segment joining any Lwo points of Hi lieu everywhere within or equal to the distance I of S, 1. INTIt,01)UCTION