Results 241 to 250 of about 595,040 (298)

Digital geometry

The Mathematical Intelligencer, 1989
This article introduces the basic concepts of digital geometry in the plane, which studies geometric properties of sets of lattice points produced by digitizing regions or curves. Some open questions and generalizations are discussed and it is given a brief guide to the literature.
Rosenfeld, Azriel, Melter, Robert A.
openaire   +2 more sources

Digital geometry

Information Sciences, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rosenfeld, Azriel, Klette, Reinhard
openaire   +2 more sources

Geometry in digital molecular arrays

Organic & Biomolecular Chemistry, 2006
The development of digital molecular devices arises through the appropriate geometric positioning of a molecular assay. A detailed evaluation of the digital media reveals the critical aspects of geometric positioning in terms of developing an analytically-robust system for molecular analysis.
James J, La Clair, Michael D, Burkart
openaire   +2 more sources

Digital Differential Geometry Processing

Journal of Computer Science and Technology, 2006
The theory and methods of digital geometry processing has been a hot research area in computer graphics, as geometric models serves as the core data for 3D graphics applications. The purpose of this paper is to introduce some recent advances in digital geometry processing, particularly mesh fairing, surface parameterization and mesh editing, that ...
Xin-Guo Liu, Hu-Jun Bao, Qun-Sheng Peng
openaire   +1 more source

Hyperspheres in digital geometry

Information Sciences, 1990
For two points x,y of the k-dimensional rectangular grid, their distance may be defined as \[ d_ m(x,y)=\max \{L_{\infty}(x,y),\frac{1}{m}L_ 1(x,y)\}, \] where \(L_ p\) denotes the standard \(L_ p\)-norm in k- space. The volume (or surface) of a digitized k-dimensional sphere with radius r around grid point x is measured by the number of grid points y ...
Das, P. P., Chatterji, B. N.
openaire   +1 more source

Generalized distances in digital geometry

Information Sciences, 1987
This paper proposes a generalized distance measure called m-neighbour distance in quantized n-dimensional space. Given two points \(P=\{x_ i\}\) and \(Q=\{y_ i\}\) for \(1\leq i\leq n\), the m-neighbour distance is defined as: \[ d^ n_ m(P,Q)=\max (\max^{n}_{k=1}X_ k,\quad \lceil \sum^{n}_{k=1}X_ k/m\rceil)\quad, \] where \(X_ k=| x_ k-y_ k|\), \(1\leq
Das, P. P., Chakrabarti, P. P., Chatterji, B. N.   +2 more
openaire   +2 more sources