Sciweavers

51 search results - page 4 / 11
» Geometry, flows, and graph-partitioning algorithms
Sort
View
CAD
2007
Springer
14 years 9 months ago
Computing general geometric structures on surfaces using Ricci flow
Systematically generalizing planar geometric algorithms to manifold domains is of fundamental importance in computer aided design field. This paper proposes a novel theoretic fra...
Miao Jin, Feng Luo 0002, Xianfeng David Gu
COMPGEOM
2008
ACM
14 years 11 months ago
Robust construction of the three-dimensional flow complex
The Delaunay triangulation and its dual the Voronoi diagram are ubiquitous geometric complexes. From a topological standpoint, the connection has recently been made between these ...
Frédéric Cazals, Aditya G. Parameswa...
MEMICS
2010
14 years 4 months ago
A Simple Topology Preserving Max-Flow Algorithm for Graph Cut Based Image Segmentation
In this paper, we propose a modification to the Boykov-Kolmogorov maximum flow algorithm [2] in order to make the algorithm preserve the topology of an initial interface. This alg...
Ondrej Danek, Martin Maska
SIGGRAPH
2010
ACM
15 years 1 months ago
A novel algorithm for incompressible flow using only a coarse grid projection
Large scale fluid simulation can be difficult using existing techniques due to the high computational cost of using large grids. We present a novel technique for simulating deta...
Michael Lentine, Wen Zheng, Ronald Fedkiw
CGF
2010
95views more  CGF 2010»
14 years 9 months ago
Polygonal Surface Advection applied to Strange Attractors
Strange attractors of 3D vector field flows sometimes have a fractal geometric structure in one dimension, and smooth surface behavior in the other two. General flow visualization...
S. Yan, N. Max, K.-L. Ma