1879 search results - page 293 / 376 » Computational geometry algorithms library |
138
click to vote
JGO
2010
14 years 11 months ago
2010
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...
165
click to vote
TOG
2012
13 years 6 months ago
2012
We propose a new ghost fluid approach for free surface and solid boundary conditions in Smoothed Particle Hydrodynamics (SPH) liquid simulations. Prior methods either suffer from...
139
click to vote
SIGGRAPH
1999
ACM
15 years 8 months ago
1999
ACM
We present a new method for user controlled morphing of two homeomorphic triangle meshes of arbitrary topology. In particular we focus on the problem of establishing a corresponde...
137
click to vote
FOCS
1991
IEEE
15 years 8 months ago
1991
IEEE
We wish to increase the power of an arbitrary algorithm designed for non-degenerate input, by allowing it to execute on all inputs. We concentrate on in nitesimal symbolic perturba...
279
click to vote
GIS
2008
ACM
16 years 5 months ago
2008
ACM
This paper presents an automatic algorithm which reconstructs building models from airborne LiDAR (light detection and ranging) data of urban areas. While our algorithm inherits t...