Farthest Point Seeding for Placement of Streamlines - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2006

Farthest Point Seeding for Placement of Streamlines


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.
Fichier principal
Vignette du fichier
RR-5524.pdf (5.71 Mo) Télécharger le fichier

Dates and versions

inria-00070483 , version 1 (19-05-2006)


  • 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⟩
239 View
552 Download


Gmail Facebook Twitter LinkedIn More