8196 search results - page 1309 / 1640 » Computational Modeling and Complexity Science |
147
click to vote
COMPGEOM
2008
ACM
15 years 6 months ago
2008
ACM
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 ...
139
click to vote
SGP
2003
15 years 6 months ago
2003
We present a new remeshing scheme based on the idea of improving mesh quality by a series of local modifications of the mesh geometry and connectivity. Our contribution to the fa...
190
click to vote
CG
2008
Springer
15 years 5 months ago
2008
Springer
Particle-based simulation methods are used to model a wide range of complex phenomena and to solve time-dependent problems of various scales. Effective visualizations of the resul...
152
click to vote
CG
2007
Springer
15 years 5 months ago
2007
Springer
The winged- and half- edge data structures are commonly used representations for polyhedron models. Due to the complexity, students in an introductory to computer graphics course ...
137
Voted
MP
2006
15 years 4 months ago
2006
Abstract. Traditional stochastic programming is risk neutral in the sense that it is concerned with the optimization of an expectation criterion. A common approach to addressing ri...