• Corpus ID: 11981528

New Visualization of Surfaces in Parallel Coordinates - Eliminating Ambiguity and Some Over-Plotting

@article{Izhakian2004NewVO,
  title={New Visualization of Surfaces in Parallel Coordinates - Eliminating Ambiguity and Some Over-Plotting},
  author={Zur Izhakian},
  journal={ArXiv},
  year={2004},
  volume={cs.OH/0403004}
}
  • Z. Izhakian
  • Published 1 March 2004
  • Mathematics, Computer Science, Physics
  • ArXiv
A point P 2 R n is represented in Parallel Coordinates by a polygonal line ¯ P (see [Ins99] for a recent survey). Earlier [Ins85], a surface ae was represented as the envelope of the polygonal lines representing it’s points. This is ambiguous in the sense that different surfaces can provide the same envelopes. Here the ambiguity is eliminated by considering the surface ae as the envelope of it’s tangent planes and in turn, representing each of these planes by n-1 points [Ins99]. This, with some… 
Avoiding the “ Over-Plotting ” Problem
Until now the representation (i.e. modeling) of curve in Parallel Coordinates is constructed from the point ↔ line duality. The result is a “line-curve” which is seen as the envelope of it’s
Algebraic curves in parallel coordinates - avoiding the "over-plotting" problem
TLDR
It is shown that the dual of an algebraic curve of degree $n$ is angebraic of degree at most $n(n - 1)$ in the absence of singular points and the result that conics map into conics follows as an easy special case.
Análisis de datos multivariantes con coordenadas paralelas
El objetivo de la investigacion, que da sustenta al articulo, fue organizar los datos estadisticos de la institucion para contribuir con la toma de decisiones a partir de informacion actualizada y

References

SHOWING 1-10 OF 18 REFERENCES
The plane with parallel coordinates
  • A. Inselberg
  • Mathematics, Computer Science
    The Visual Computer
  • 2005
TLDR
A new duality betweenbounded and unbounded convex sets and hstars (a generalization of hyperbolas) and between Convex Unions and Intersections is found and motivates some efficient ConveXity algorithms and other results inComputational Geometry.
Ideals, Varieties, and Algorithms
(here, > is the Maple prompt). Once the Groebner package is loaded, you can perform the division algorithm, compute Groebner bases, and carry out a variety of other commands described below. In
2001.An Algorithm For Computing A Polynomial’s Dual Curve In Parallel Coordinates
  • M.sc thesis,
  • 2001
An Algorithm For Computing A Polynomial's Dual Curve In Parallel Coordinates. M.sc thesis
  • An Algorithm For Computing A Polynomial's Dual Curve In Parallel Coordinates. M.sc thesis
  • 2001
An Algorithm For Computing A Polynomial's Dual Curve In Parallel Coordinates. M.sc thesis
  • An Algorithm For Computing A Polynomial's Dual Curve In Parallel Coordinates. M.sc thesis
  • 2001
Don ’ t panic . . . do it in parallel !
  • Computational Statistics
  • 1999
Don't panic ... do it in parallel
  • Computational Statistics
  • 1999
Don't panic ... do it in parallel
  • Computational Statistics
  • 1999
and O’Shea
  • D.
  • 1997
Algebraic Geometry, vol. A rst course
  • Algebraic Geometry, vol. A rst course
  • 1992
...
1
2
...