Titlebook: Discrete Geometry for Computer Imagery; 6th International Wo Serge Miguet,Annick Montanvert,Stéphane Ubéda Conference proceedings 1996 Spri

逢迎春日

Eulogy

Valves

典型

背信

文字

Fast computation of the normal vector field of the surface of a 3-D discrete object,eters. Elementary components of discrete surfaces, called surfels, contain some geometric information, but at a scale that is too small with respect to the scale at which we actually want to describe objects. We present here a fast computational technique to compute the normal vector field of a disc

grotto

軟膏

Polyhedra generation from lattice points,mages. The method is based on combinatorial topology [1] and algebraic properties of the 3D lattice space [2]. It is shown that the method can uniquely generate polyhedra from a subset of the lattice space independently of the choice of neighborhood. Furthermore, a practical algorithm is developed a

Assault

Recognizing arithmetic straight lines and planes,s in ?. (resp. ?.) belongs to a line (resp. a plane). In this paper the lines and planes are arithmetic, as defined by Reveilles [Rev91], and the problem is translated, for any width that is a linear function of the coefficients of the normal to the searched line or plane, into the problem of solvin

無(wú)法破譯