Titlebook: Discrete Geometry for Computer Imagery; 7th International Wo Ehoud Ahronovitz,Christophe Fiorio Conference proceedings 1997 Springer-Verlag

papyrus

書目名稱Discrete Geometry for Computer Imagery影響因子(影響力)




書目名稱Discrete Geometry for Computer Imagery影響因子(影響力)學(xué)科排名




書目名稱Discrete Geometry for Computer Imagery網(wǎng)絡(luò)公開度




書目名稱Discrete Geometry for Computer Imagery網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Discrete Geometry for Computer Imagery被引頻次




書目名稱Discrete Geometry for Computer Imagery被引頻次學(xué)科排名




書目名稱Discrete Geometry for Computer Imagery年度引用




書目名稱Discrete Geometry for Computer Imagery年度引用學(xué)科排名




書目名稱Discrete Geometry for Computer Imagery讀者反饋




書目名稱Discrete Geometry for Computer Imagery讀者反饋學(xué)科排名

ALTER

On the reconstruction of finite lattice sets from their X-rays,or the reconstruction of crystalline structures from images produced by quantitative high resolution transmission electron microscopy..In particular, we discuss questions related to the ill-posedness of the problem, determine the computational complexity of the basic underlying tasks and indicate al

故意釣到白楊

Applications of digital straight segments to economical image encoding,gital straight line segments in boundary curves is presented. The algorithm is applied to encode the boundaries of homogeneous regions in digitized images. The code is economical and enables an exact reconstruction of the original image.

hauteur

Multiresolution representation of shapes in binary images II: Volume images,lume images contain at high resolution can be considerably compressed at lower resolution, and while the obtained representation still can be suited for simple shape analysis tasks, provided that shape is adequately preserved when resolution decreases. In this paper, we present new methods for build

LAPSE

Coplanar tricubes, the total number of the tricubes that may appear in a naive plane is fourty..This study concerns the . of tricubes in a plane. We call . any set of tricubes, such as a naive plane exists, which contains all the tricubes of this set without any other. We present an algorithm which calculates the set

新星

新星

A linear algorithm for constructing the polygon adjacency relation in iso-surfaces of 3D images,iscrete nature of data allows us to build this adjacency relation in a time proportional to the number of triangles .. We have payed a special attention on the memory requirements, since our method takes as input the surface extracted by the Marching-Cubes algorithm and does not make reference to th

declamation

liposuction

Digital topologies revisited: An approach based on the topological point-neighbourhood,nify the proof technique of the results on 4-connectedness and on 8-connectedness in ?.. We also show that there is no topology compatible with 6-connectedness. We shortly comment on potential further use of this approach.

Daily-Value