The grand tour: a tool for viewing multidimensional data
SIAM Journal on Scientific and Statistical Computing
Convex hulls of piecewise-smooth Jordan curves
Journal of Algorithms
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
A Bibliography on Digital and Computational Convexity (1961-1988)
IEEE Transactions on Pattern Analysis and Machine Intelligence
Multiresolution multidimensional wavelet brushing
Proceedings of the 7th conference on Visualization '96
Multivariate visualization using metric scaling
VIS '97 Proceedings of the 8th conference on Visualization '97
Visualizing high dimensional datasets and multivariate relations (tutorial AM-2)
Tutorial notes of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
Parallel coordinates: a tool for visualizing multi-dimensional geometry
VIS '90 Proceedings of the 1st conference on Visualization '90
Pruning and Visualizing Generalized Association Rules in Parallel Coordinates
IEEE Transactions on Knowledge and Data Engineering
A grid-enabled problem solving environment for parallel computational engineering design
Advances in Engineering Software
Discussion: Interacting with parallel coordinates
Interacting with Computers
Visual Exploration of Frequent Itemsets and Association Rules
Visual Data Mining
Visualizing frequent itemsets, association rules, and sequential patterns in parallel coordinates
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartI
| Hi-index | 0.00 |
With a system of parallel coordinates, objects in RN can be represented with planar “graphs” (i.e., planar diagrams) for arbitrary N [21]. In R2, embedded in the projective plane, parallel coordinates induce a point ← → line duality. This yields a new duality between bounded and unbounded convex sets and hstars (a generalization of hyperbolas), as well as a duality between convex union (convex merge) and intersection. From these results, algorithms for constructing the intersection and convex merge of convex polygons in O(n) time and the convex hull on the plane in O(log n) for real-time and O(n log n) worst-case construction, where n is the total number of points, are derived. By virtue of the duality, these algorithms also apply to polygons whose edges are a certain class of convex curves. These planar constructions are studied prior to exploring generalizations to N-dimensions. The needed results on parallel coordinates are given first.