Results 251 to 260 of about 582,540 (283)

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

Digital breast tomosynthesis geometry calibration

SPIE Proceedings, 2007
Digital Breast Tomosynthesis (DBT) is a 3D x-ray technique for imaging the breast. The x-ray tube, mounted on a gantry, moves in an arc over a limited angular range around the breast while 7-15 images are acquired over a period of a few seconds. A reconstruction algorithm is used to create a 3D volume dataset from the projection images.
Xinying Wang, James G. Mainprize, Michael P. Kempston, Gordon E. Mawdsley, Martin J. Yaffe   +4 more
openaire   +1 more source

Using Digital Resources in Geometry Lessons

Общество: социология, психология, педагогика, 2023
In this paper, examples of the use of digital resources in geometry lessons are considered. The aim of the study is to solve the problem of using digital educational resources to activate students’ thinking, increase their interest in learning geometry, improve their ability to memorize new concepts, and activate their own self-learning skills.
Nuruila S. Mambetova, Tatiana I. Anisimova   +1 more
openaire   +1 more source

Distance functions in digital geometry

Information Sciences, 1987
An analysis of paths and distances in n dimensions is carried out using variable neighborhood sequences. A symbolic expression for the distance function between any two points in this quantized space is derived. An algorithm for finding the shortest path is presented.
Das, P. P., Chakrabarti, P. P., Chatterji, B. N.   +2 more
openaire   +2 more sources

Metric bases in digital geometry

Computer Vision, Graphics, and Image Processing, 1984
The authors consider the set D of all points in the Euclidean plane with integral coordinates (digital plane). Given a metric d on \(A\subset D\), a subset \(S\subset A\) is called a metric basis for A if \(d(x,s)=d(y,s)\) for all \(s\in S\) implies \(x=y.\) It is well known that a minimal metric basis for the Euclidean plane with respect to the ...
Melter, Robert A., Tomescu, Ioan
openaire   +1 more source

Digital watermarking of 3D geometry

Proceedings of 2004 International Symposium on Intelligent Signal Processing and Communication Systems, 2004. ISPACS 2004., 2005
A non-blind robust watermarking algorithm is proposed for 3D mesh models. The watermark is inserted into the 2D image which is extracted from the target 3D model. Each pixel value of the extracted 2D image represents a distance from the predefined reference points to the face of the given 3D model.
null Han Sae Song, null Nam Ik Cho
openaire   +1 more source

Knight's distance in digital geometry

Pattern Recognition Letters, 1988
It is shown that the knight's moves (as in the game of chess) are defining a metric in the digital plane. The functional form of this metric is presented. An algorithm for tracing a minimal knight's path is given which has linear time complexity measured by the path length. The knight's distance is compared with the octagonal distance.
Das, P. P., Chatterji, B. N.
openaire   +1 more source

The t-Cost distance in digital geometry

Information Sciences, 1992
The authors define certain distance functions in an \(n\)-D grid. There the distances of neighbour points may be unequal to unity. They derive a characterisation of such distance functions to define a metric. These distances then are called \(t\)-cost distances.
Das, P. P., Mukherjee, Jayanta, Chatterji, B. N.   +2 more
openaire   +1 more source