Sciweavers

3740 search results - page 242 / 748
» A Fast Skeletonization Method
Sort
View
GRAPHICSINTERFACE
2000
15 years 2 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
99
Voted
SODA
1997
ACM
199views Algorithms» more  SODA 1997»
15 years 2 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 26 days 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,...
89
Voted
CGF
2010
98views more  CGF 2010»
15 years 25 days 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 ...
CORR
2010
Springer
109views Education» more  CORR 2010»
15 years 25 days ago
Fast simulation of large-scale growth models
We give an algorithm that computes the final state of certain growth models without computing all intermediate states. Our technique is based on a "least action principle"...
Tobias Friedrich, Lionel Levine