From computational geometry comes the notion of a Gabriel graph of a point set in the plane. The Gabriel graph consists of those edges connecting two points of the point set such t...
We prove that the lines tangent to four possibly intersecting convex polyhedra in 3 with n edges in total form Θ(n2 ) connected components in the worst case. In the generic ca...
The presented approach to discretization of functionally defined heterogeneous objects is oriented towards applications associated with numerical simulation procedures, for exampl...
Elena Kartasheva, Valery Adzhiev, Alexander A. Pas...
We discuss potential and limitations of a Morph Node, inspired by the corresponding construct in Java3D. A Morph Node in Java3D interpolates vertex attributes among several homeom...
This video illustrates an algorithm for computing a maximum number of disjoint paths for unit disks moving among a set of dynamic obstacles in the plane. The problem is motivated ...
Joondong Kim, Joseph S. B. Mitchell, Valentin Poli...