HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

Farthest Point Seeding for Placement of Streamlines

Abstract : 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 started 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. We show in a series of comparative results several improvements over state-of-the-art methods for three important aspects: placement quality, simplicity or efficiency. 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.
Document type :
Complete list of metadata

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Friday, May 19, 2006 - 8:38:11 PM
Last modification on : Friday, February 4, 2022 - 3:16:11 AM
Long-term archiving on: : Sunday, April 4, 2010 - 9:19:22 PM


  • HAL Id : inria-00070483, version 1



Abdelkrim Mebarki, Pierre Alliez, Olivier Devillers. Farthest Point Seeding for Placement of Streamlines. [Research Report] RR-5524, INRIA. 2006, pp.28. ⟨inria-00070483⟩



Record views


Files downloads