Sciweavers

3630 search results - page 222 / 726
» Fast Marching Methods
Sort
View
WSCG
2003
179views more  WSCG 2003»
15 years 7 months ago
Antipole Clustering for Fast Texture Synthesis
This paper describes a new method for analysis/synthesis of textures using a non-parametric multi-resolution approach able to reproduce efficiently the generative stochastic proce...
Sebastiano Battiato, Alfredo Pulvirenti, Diego Ref...
GRAPHICSINTERFACE
2000
15 years 7 months ago
Fast and Controllable Simulation of the Shattering of Brittle Objects
We present a method for the rapid and controllable simulation of the shattering of brittle objects under impact. An object to be broken is represented as a set of point masses con...
Jeffrey Smith, Andrew P. Witkin, David Baraff
SODA
1997
ACM
199views Algorithms» more  SODA 1997»
15 years 7 months ago
Fast Algorithms for Sorting and Searching Strings
We present theoretical algorithms for sorting and searching multikey data, and derive from them practical C implementations for applications in which keys are character strings. T...
Jon Louis Bentley, Robert Sedgewick
BMCBI
2008
121views more  BMCBI 2008»
15 years 6 months ago
A simple and fast heuristic for protein structure comparison
Background: Protein structure comparison is a key problem in bioinformatics. There exist several methods for doing protein comparison, being the solution of the Maximum Contact Ma...
David A. Pelta, Juan Ramón González,...
CGF
2010
98views more  CGF 2010»
15 years 6 months ago
Fast Generation of Pointerless Octree Duals
Geometry processing applications frequently rely on octree structures, since they provide simple and efficient hierarchies for discrete data. However, octrees do not guarantee dire...
Thomas Lewiner, Vinícius Mello, Adelailson ...