Titlebook: Discrete Geometry for Computer Imagery; 16th IAPR Internatio Isabelle Debled-Rennesson,Eric Domenjoud,Philippe Conference proceedings 2011

Boldfaced

书目名称Discrete Geometry for Computer Imagery影响因子(影响力)




书目名称Discrete Geometry for Computer Imagery影响因子(影响力)学科排名




书目名称Discrete Geometry for Computer Imagery网络公开度




书目名称Discrete Geometry for Computer Imagery网络公开度学科排名




书目名称Discrete Geometry for Computer Imagery被引频次




书目名称Discrete Geometry for Computer Imagery被引频次学科排名




书目名称Discrete Geometry for Computer Imagery年度引用




书目名称Discrete Geometry for Computer Imagery年度引用学科排名




书目名称Discrete Geometry for Computer Imagery读者反馈




书目名称Discrete Geometry for Computer Imagery读者反馈学科排名

Detoxification

Ball-Based Shape Processingith a ball of fixed radius. We review their extensions to variable distance offsetting. Specifically, we compare three different formulations of variable distance offsetting for planar shapes: orthogonal, radial, and ball. We discuss compatibility conditions that specify when a shape is the offset o

separate

An Arithmetic and Combinatorial Approach to Three-Dimensional Discrete Lineshe three-dimensional space. We consider discrete segments that connect the origin to a given point (..,..,..) with coprime nonnegative integer coordinates. This generation method is based on generalized three-dimensional Euclid’s algorithms acting on the triple (..,..,..). We associate with the step

Repetitions

Smooth 2D Coordinate Systems on Discrete Surfaces the Riemann mapping theorem. Our algorithm can parameterize triangular, quadrangular and digital meshes. It can be adapted to preserve metric properties. To demonstrate the efficiency of our method, many examples are shown in the experiment section.

Microgram

FLING

Introduction to Digital Level Layersnvestigate some theoretical properties of this class of digital primitives according to topological and morphological criteria. The second task is to show that even if we consider functions . of high degree, the computations on Digital Level Layers, for instance the computation of a DLL containing a

FLING

Associating Cell Complexes to Four Dimensional Digital Objectspresentation consists on associating a cell complex homologically equivalent to the digital object. To determine the pieces of this cell complex, algorithms based on weighted complete graphs and integral operators are shown. We work with integer coefficients, in order to compute the integer homology

alleviate

Vital-Signs

AFFIX

Hierarchic Euclidean Skeletons in Cubical Complexes parameter. We provide in this article a discrete framework which formalizes and generalizes this notion, in particular to higher dimensions. This framework allows us to propose a new skeletonization scheme and to prove several important properties, such as topology preservation and stability w.r.t.