153 search results - page 31 / 31 » On an equivalence in discrete extremal problems |
CCCG
2003
13 years 7 months ago
2003
Morphing algorithms aim to construct visually pleasing interpolations (morphs) between 2D or 3D shapes. One of the desirable properties of a morph is avoiding selfintersections of...
ENTCS
2007
13 years 6 months ago
2007
The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether de...
SMA
2009
ACM
14 years 23 days ago
2009
ACM
We present the “Dynamic Packing Grid” (DPG) data structure along with details of our implementation and performance results, for maintaining and manipulating flexible molecul...