Sciweavers

2980 search results - page 215 / 596
» Computational Geometry
Sort
View
106
Voted
JCC
2007
70views more  JCC 2007»
15 years 3 months ago
Self-organizing superimposition algorithm for conformational sampling
Abstract: A novel self-organizing algorithm for conformational sampling is introduced, in which precomputed conformations of rigid fragments are used as templates to enforce the de...
Fangqiang Zhu, Dimitris K. Agrafiotis
GRAPHITE
2004
ACM
15 years 9 months ago
Smooth constraints for spline variational modeling
This article introduces a new class of constraints for spline variational modeling, which allows more flexible user specification, as a constrained point can ”slide” along a...
Julien Lenoir, Laurent Grisoni, Philippe Meseure, ...
119
Voted
ICIP
2007
IEEE
16 years 5 months ago
Epipolar Spaces for Active Binocular Vision Systems
Depth recovery for active binocular vision systems is simplified if the camera geometry is known and corresponding points can be restricted to epipolar lines. Unfortunately, compu...
James Monaco, Alan C. Bovik, Lawrence K. Cormack
216
Voted
TOG
2012
242views Communications» more  TOG 2012»
13 years 6 months ago
Precomputed acceleration noise for improved rigid-body sound
We introduce an efficient method for synthesizing acceleration noise – sound produced when an object experiences abrupt rigidbody acceleration due to collisions or other contac...
Jeffrey N. Chadwick, Changxi Zheng, Doug L. James
125
Voted
COMPGEOM
2004
ACM
15 years 9 months ago
Approximate convex decomposition of polygons
We propose a strategy to decompose a polygon, containing zero or more holes, into “approximately convex” pieces. For many applications, the approximately convex components of ...
Jyh-Ming Lien, Nancy M. Amato