#### Filter Results:

- Full text PDF available (7)

#### Publication Year

2004

2007

- This year (0)
- Last 5 years (0)
- Last 10 years (4)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Dmytro Chibisov, Ernst W. Mayr, Sergey Pankratov
- Automated Deduction in Geometry
- 2004

In this paper, we propose a symbolic-numerical algorithm for collision-free placement and motion of an object avoiding collisions with obstacles. The algorithm is based on the combination of configuration space and energy approaches. According to the configuration space approach , the position and orientation of the geometric object to be moved or placed is… (More)

Automatic generation of smooth, non-overlapping meshes on arbitrary regions is the well-known problem. Considered as optimization task the problem may be reduced to finding a minimizer of the weighted combination of so-called length, area, and orthogonality functionals. Unfortunately , it has been shown that on the one hand, certain weights of the… (More)

1. (a,b)-Trees As we saw in the previous section, the efficiency of standard operations on binary search trees depends on the maximum tree height. Using height balancing, we ensure that trees cannot degenerate linearly but instead have logarithmic height. Let us extend this approach to more general trees. Motivation: assume tree nodes are stored in… (More)

Automatic generation of smooth, non-overlapping meshes on arbitrary regions is the well-known problem. Considered as optimization task the problem may be reduced to finding a minimizer of the weighted combination of so-called length, area, and orthogonality functionals. Unfortunately , it has been shown that on the one hand, certain weights of the… (More)

- Sven Kosub, Ernst W. Mayr, +45 authors Andreas Weißl
- 2007

Preface I am deeply grateful to all which have contributed to this work by their comments and discussions, by hints, advice, and patience. In particular, I would like to thank For allowing me to present joint work here, many thanks are due to my coauthors and colleagues The algorithms group (" LEA ") at the Technische Universität München has always provided… (More)

We present an algorithm for computing the motion of so-called 321 kinematic chains, which belong to the class of serial robots and are widely used for many industrial applications. After a suitable parametrization of the solution space, the problem can be reduced to the finite dimensional one. Since 321 chains admit closed form solutions for inverse… (More)

We investigate the stability of the modified difference scheme of Kim and Moin for numerical integration of two-dimensional incom-pressible Navier–Stokes equations by the Fourier method and by the method of discrete perturbations. The obtained analytic-form stability condition gives the maximum time steps allowed by stability, which are by factors from 2 to… (More)

- Dmytro Chibisov, Ernst W. Mayr
- SNC
- 2007

In the present paper<sup>1</sup> we consider the kinematic properties of robots with 6 rotational joints and describe an approach for optimization of robot motion due to given geometric and differential constraints (i.e. constraints on velocity and orientation of the robot end-effector during the execution of some tasks, and limits on velocities and… (More)

- ‹
- 1
- ›