Sciweavers

455 search results - page 11 / 91
» Improved Force-Directed Layouts
Sort
View
CGF
2006
136views more  CGF 2006»
13 years 9 months ago
Cache-Efficient Layouts of Bounding Volume Hierarchies
We present a novel algorithm to compute cache-efficient layouts of bounding volume hierarchies (BVHs) of polygonal models. Our approach does not make any assumptions about the cac...
Sung-Eui Yoon, Dinesh Manocha
GD
2009
Springer
14 years 2 months ago
Port Constraints in Hierarchical Layout of Data Flow Diagrams
Abstract. We present a new application for graph drawing in the context of graphical model-based system design, where manual placing of graphical items is still state-of-the-practi...
Miro Spönemann, Hauke Fuhrmann, Reinhard von ...
ICDAR
1999
IEEE
14 years 2 months ago
Methodology for Flexible and Efficient Analysis of the Performance of Page Segmentation Algorithms
This paper presents part of a new DIA performance analysis framework aimed at Layout Analysis algorithm developers. A new region-representation scheme (an interval-based descripti...
Apostolos Antonacopoulos, A. Brough
TOG
2002
107views more  TOG 2002»
13 years 9 months ago
Ordered and quantum treemaps: Making effective use of 2D space to display hierarchies
Treemaps, a space-filling method of visualizing large hierarchical data sets, are receiving increasing attention. Several algorithms have been proposed to create more useful displ...
Benjamin B. Bederson, Ben Shneiderman, Martin Watt...
TVCG
2010
165views more  TVCG 2010»
13 years 4 months ago
Binary Mesh Partitioning for Cache-Efficient Visualization
Abstract--One important bottleneck when visualizing large data sets is the data transfer between processor and memory. Cacheaware (CA) and cache-oblivious (CO) algorithms take into...
Marc Tchiboukdjian, Vincent Danjean, Bruno Raffin