Titlebook: Discrete Geometry for Computer Imagery; 9th International Co Gunilla Borgefors,Ingela Nystr?m,Gabriella Sanniti Conference proceedings 2000

粘土

An Algorithm for Reconstructing Special Lattice Sets from Their Approximate X-Rayst of Z2 having some convexity properties. This algorithm can be used for reconstructing convex subsets of Z2 from their exact X-rays in some sets of four prescribed lattice directions, or in any set of seven prescribed mutually nonparallel lattice directions.

粗魯性質(zhì)

Armada

The Reconstruction of the Digital Hyperbola Segment from Its Codeonding to the hyperbolas of the form y = α/x-β+γ inscribed into the (m × m )-integer grid. An O (m · (log(m + |β| )).) algorithm for recovering the digital hyperbola segment from its proposed code, is presented.

Banister

Determining Visible Points in a Three-Dimensional Discrete Spacethe ray with other object points. Since the projection of points onto the viewing plane is done by a continuous mapping, additionally to the discrete ray, the location of the continuous projection ray is examined regarding its location to the surface points that are intersected by the discrete ray.

煞費(fèi)苦心

原始

https://doi.org/10.2991/978-94-6239-246-5oles in X” which is not su.cient for our purpose but we use the linking number de.ned in [FM00]. In so doing, we formalize the proofs of several results stated without proof in the literature (Bertrand, Kong, Morgenthaler).

魔鬼在游行