Several motion planning methods using networks of randomly generated nodes in the free space have been shown to perform well in a number of cases, however their performance degrad...
Steven A. Wilmarth, Nancy M. Amato, Peter F. Still...
The computer--aidedsolution to algorithmic problemsis becoming moreandmoreimportant in variousapplicationdomains.This is in particular true for computationalgeometry.For example,g...
The video Geodesics and Waves introduces the concepts of straightest geodesics and geodesic flow on polyhedral surfaces. It is the third in a series of videos presenting research ...
Konrad Polthier, Markus Schmies, Martin Steffens, ...
We present a novel algorithm for encoding the topology of triangular meshes. A sequence of edge contract and divide operations collapses the entire mesh into a single vertex. This ...
We propose a speed-up method for discrete-event simulations, including sweep-line or -plane techniques, requiring the repeated calculation of the times at which certain discrete e...
This paper presents the Hierarchical Walk, or H-Walk algorithm, which maintains the distance between two moving convex bodies by exploiting both motion coherence and hierarchical ...
We wish to extract the topology from scanned maps. In previous work [15] this was done by extracting a skeleton from the Voronoi diagram, but this required vertex labelling and wa...