Titlebook: Discrete Geometry for Computer Imagery; 15th IAPR Internatio Sre?ko Brlek,Christophe Reutenauer,Xavier Proven?a Conference proceedings 2009

Isometric

Gianguido Dall’Agata,Marco Zagermanns. This paper defines a novel purely digital deformable model (DDM), whose internal energy is based on the minimum length polygon (MLP). We prove that our combinatorial regularization term has “convex” properties: any local descent on the energy leads to a global optimum. Similarly to the continuous

Airtight

LVAD360

GEN

0302-9743 entation and analysis; discrete and combinatorial Topology; models for discrete geometry; geometric transforms; and discrete tomography.978-3-642-04396-3978-3-642-04397-0Series ISSN 0302-9743 Series E-ISSN 1611-3349

套索

Connections on Super Riemann Surfacesse a relevant error metric tool to compare results and show our new method is more accurate than Marching Cube which is the most widely used triangulation algorithm in the surface reconstruction process of scanned objects.

obstruct

Marching Triangle Polygonization for Efficient Surface Reconstruction from Its Distance Transformse a relevant error metric tool to compare results and show our new method is more accurate than Marching Cube which is the most widely used triangulation algorithm in the surface reconstruction process of scanned objects.

膠狀

Arithmetic Discrete Planes Are Quasicrystalsnstruction process for tilings. We then introduce a substitution rule acting on discrete planes, which maps faces of unit cubes to unions of faces, and we discuss some applications to discrete geometry.

Fecal-Impaction

Affine Connections, and Midpoint Formation element x in a ring . is called nilpotent if ..?=?0 for suitable non-negative integer ..).Synthetic differential geometry (SDG) is an axiomatic theory, based on such nilpotent infinitesimals. It can be proved, via topos theory, that the axiomatics covers both the differential-geometric notions of algebraic geometry and those of calculus.

孤獨(dú)無(wú)助

On Three Constrained Versions of the Digital Circular Arc Recognition Problemboundary that is incident to a given point, or a center that is on a given straight line. Solving these subproblems is interesting in itself, but also for the recognition of digital circular arcs. The proposed algorithm can be iteratively used for this problem. Moreover, since the algorithm is online, it provides a way to segment digital curves.

paradigm

Multiscale Discrete Geometryblinear algorithm computing the exact characteristics of a DSS whenever it is a subset of a known standard line. We finally deduce an algorithm for computing a multiscale representation of a digital shape, based only on a DSS decomposition of its boundary.