generalization of pick's theorem for surface of polyhedra  the pick's theorem is one of the rare gems of elementarymathematics because this is a very innocent sounding hypothesisimply a very surprising conclusion (bogomolny 1997). yet thestatement of the theorem can be understood by a fifth grader. calla polygon a lattice polygon if the co-ordinates of its vertices areintegers. pick's theorem asserts that the area of a lattice polygon_p_ is given by _a(p)_ = _i(p)_ \\+ _b(p) / 2 -1_ = _v(p) - b(p) / 2 - 1_ where _i(p), b(p)_ and_v(p)_ are the number of _interior_ lattice points, thenumber of _boundary_ lattice points and the _total_number of lattice points of _p_ respectively. it is worth tomention that the _i(p)_ (understand like _digital area_)is _digital mapping standard_ in usa since decade (morrison,j. l. 1988 and 1989). because the pick's theorem was firstpublished in 1899 therefore our planned presentation had timing its100 anniversary. currently it has greater importance than realizedheretofore because of the pick's theorem forms a connection betweenthe old _euclidean_ and the new _digital (discrete)geometry._ during this long period lots of proof had been madeof pick's theorem and many trial of its generalization from simplepolygons towards complex polygon networks, moreover tried to extendit to the direction of 3d geometrical objects as well. it is alsoturned out that nowadays the _inverse pick's formulas_ comesto the front instead of the original ones, consequently of powerfulspreading the digital geometry and mapping. today the question isnot the old one: how can we produce traditional area withoutco- ordinates, using only inside points and boundary points. just onthe contrary: _how is it possible to simply determine digitalboundary and digital area (namely the number of boundary points andinside points) using known co- ordinates of vertices._ theinverse formulas are: _b(p)= gcd (Äx, Äy,Äz)_ (1d pick's theorem) and _i(p)=a(p)-b(p)/2+1_ (2dpick's theorem) where gcd is the great common divisor of theco-ordinate differences of two-two neighboring vertices. the ourmain object is not these formulas to present, but we desire to showthat the _pick's theorem (after adequate redrafting) indeed validfor every spatial triangle which are determined by three arbitrarypoints of a 3d lattice._ the original planar theorem is only aspecial case of it. however if it is true then its valid not onlyfor triangles but all irregular polygons also which are lying inspace and have its vertices in spatial lattice points. finally ifthe extended pick's theorem is true for all face of a latticepolyhedron then it is true for total surface as well. consequentlywe developed so simple and effective algorithms which solveenumeration tasks without the time- and memory-wasting immediatecomputing. these algorithms make possible that using thevertex-co- ordinate list and the topological description of a convexor non-convex polyhedron (cube, prism, tetrahedron etc.) gettinganswer many elementary questions. for example, _how many vaxelscan be found on the complex surface of a polyhedron, how many onits edges or on its individual faces._ we succeeded to extendour results also to the surface of non- cornered geometric objects(circle, sphere, cylinder, cone, ellipsoid etc.), but anyway, thishave to be object of another presentation.  mihaly agfalvi istvan kadar erik papp