We introduce a new realistic input model for geometric graphs and nonconvex polyhedra. A geometric graph G is local if (1) the longest edge at every vertex v is only a constant fa...
Commonly used boundary-based solid and surface modeling methods in traditional computer aided design are not capable of constructing configurations with large numbers of particles ...
The choice of mapping strategies to effectively map controller variables to sound synthesis algorithms is examined. Specifically, we look at continuous mappings that have a geom...
Doug Van Nort, Marcelo M. Wanderley, Philippe Depa...
The structure of hypersurfaces corresponding to different spatio-temporal patterns is considered, and in particular representations based on geometrical invariants, such as the Ri...
The paper first recalls the Blahut Arimoto algorithm for computing the capacity of arbitrary discrete memoryless channels, as an example of an iterative algorithm working with pro...