2006 · 95 citations · 16 references
ComputingComputer ScienceComputational GeometryGeometric ModelingScientific VisualizationDelaunay TriangulationsGeometric OptimizationGeometry ProcessingDelaunay Triangulation AlgorithmsGreedy HeuristicsPlacementProximity QueriesSeed Point PlacementStreamline SeedingTriangulation AlgorithmsVoids
We propose a novel algorithm for placement of streamlines from two-dimensional steady vector or direction fields. Our method consists of placing one streamline at a time by numerical integration starting at the furthest away from all previously placed streamlines. Such a farthest point seeding strategy leads to high quality placements by favoring long streamlines, while retaining uniformity with the increasing density. Our greedy approach generates placements of comparable quality with respect to the optimization approach from Turk and Banks, while being 200 times faster. Simplicity, robustness as well as efficiency is achieved through the use of a Delaunay triangulation to model the streamlines, address proximity queries and determine the biggest voids by exploiting the empty circle property. Our method handles variable density and extends to multiresolution.
16
Numerical Recipes in C: The Art of Scientific Computing.
Chris Birchenhall, William H. Press, Saul A. Teukolsky et al. · The Economic Journal · 1994 · 4.4K citations
Imaging vector fields using line integral convolution
Brian Cabral, Leith Casey Leedom · 1993 · 1.3K citations · Full text
Anisotropic polygonal remeshing
Pierre Alliez, David Cohen‐Steiner, Olivier Devillers et al. · 2003 · 495 citations · Full text
Spot noise texture synthesis for data visualization
Jarke J. van Wijk · 1991 · 396 citations
Anisotropic polygonal remeshing
Pierre Alliez, David Cohen‐Steiner, Olivier Devillers et al. · ACM Transactions on Graphics · 2003 · 385 citations