Message
Shape modeling is an interdisciplinary area composing theoretical and experimental results from mathematics, physics, computer graphics, computer-aided design, computer animation, and others fields. Shape modeling and mathematical simulation stand side by side, and one upholds the other. The heart of my work was solving applied problems of mathematical simulation. In general, I am interested in a problem of mathematical simulation which includes three main parts: mathematical model, numerical method and programming realization.
Now I am involved in a number of projects, such as Applications of genetic algorithms in shape modeling, Converting elevation contours to a grid, Java implementation of Turtle Graphics in 3-D, Designing client/server applications dealing with geometric modeling, Image/Surface retouching.
This projects has been initiated by previous investigations in the field of computer graphics, shape modeling and by recent advance in Java programming. Java provides the right programming paradigm to make use of the distributed machines to speed up calculations. Designing client/server applications may lure students into writing very sophisticated programs, development of collaborative Internet-based computer graphics and shape modeling applications.
Hobbies
Classic music (Tchaikovsky, Beethoven). American country music. Japanese music (Kitaro) and songs (Tanimura).
Water and alpine skiing

>PAGE TOP

Publications(January 2001 - December 2001)

1. V. Savchenko and L. Schmitt, Reconstructing Occlusal Surfaces of Teeth Using a Genetic Algorithm with Simulated Annealing Type Selection, 6th ACM Symposium on Solid Modeling and Applications, Sheraton Inn, Ann Arbor, Michigan, June 4-8, 2001, 39-46
   Abstract - In this paper, we present an application of numerical optimization for surface reconstruction (more precisely: reconstruction of missing parts of a real geometric object represented by volume data) by employing a specially designed genetic algorithm to solve a problem concerning computer-aided design in dentistry. Using a space mapping technique the surface of a given model tooth is fitted by a shape transformation to extrapolate (or reconstruct) the remaining surface of a patient's tooth with occurring damage such as a "drill hole." Thereby, the genetic algorithm minimizes the error of the approximation by optimizing a set of control points that determine the coefficients for spline functions, which in turn define a space transformation. The fitness function to be minimized by the genetic algorithm is the error between the transformed occlusal surface of the model tooth and the remaining occlusal surface of the damaged (drilled) tooth. The algorithm, that is used, is based upon a proposal by Mahfoud and Goldberg. It uses a simulated-annealing type selection scheme, which is applied sequentially (pair-wise, or one-by-one) to the members in the parent generation and their respective offspring generated by mutation-crossover. We outline a proof of convergence for this algorithm. The algorithm is parallel in regard to computing the fitness-values of creatures.
2. V. Savchenko, Y. Uchikoshi, E. Ohbuchi, T. Ikedo, Java Implementation of Turtle Graphics for 3-D Volume Objects, International Conference on Imaging Science, Systems, and Technology, Las Vegas, Nevada, June 25-28, 2001, 465- 471.
   Abstract - In the paper we study the possibility of using volume modeling in a Java environment, applying the turtle graphics approach to imitate of painting/engraving operations. In particular, Java classes and methods were developed and tested for engraving operations that are considered as a straightforward extension of the turtle graphics approach.
3. N. Kojekine, V. Savchenko, D. Berzin, I. Hagiwara, Software Tools for Compactly Supported Radial Basis Functions, CGIM 2001, IASTED Fourth International Conference on Computer Graphics and Imaging, Honolulu, Hawaii, August 13-16, 2001, 234-239
   Abstract - In this paper the use of compactly-supported radial basis functions for surface reconstruction is described. To solve the problem of reconstruction or volume data generation specially designed software is employed. Time performance of the algorithm and numerical error estimation of the reconstruction are also investigated. Thanks to the efficient octree algorithm used in this study, the resulting matrix is a band diagonal matrix that reduces computational cost and permits handling large data sets.
4. V. Savchenko and S. Sedukhin, Pattern Dependent Reconstruction of Raster Digital Elevation Models from Contour maps, VIIP 2001, IASTED International Conference on Visualization, Imaging, and Image Processing, Marbella, Spain, September 3-5, 2001, 237-244
   Abstract - Raster digital elevation models or regular grids are used basically for the description of terrain surfaces. They serve to evaluate them at any desired set of positions. An implementation of 2-D sample-based interpolation for approximation of raster digital elevation data is considered. The approach couples the minimization of a terrain roughness specified by a limited number of contour maps and the supplement of fractal-based surface erosion to mimic appearance of natural terrain surfaces.
5. V. Savchenko, Shape Modeling Based on Energy Minimized Splines, Third International Conference on Actual Problems of Information Technologies and Remote Sensing of Siberia, Ugra Research Information Technology Institute, Khanty-Mansiysk, Russia, June 14-16, 2001.
   Abstract - The paper discusses an approach of using spline technique and presents applications of finite element methods and so called radial based functions for surface reconstruction and modification.

>PAGE TOP