Searcharxiv⌕ Search

arXiv subjects

Zur Izhakian

Publications and source records attributed to Zur Izhakian.

56 records · Page 4Linked to original sources

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

$\cal{A}$ point $P \in \Real^n$ is represented in Parallel Coordinates by a polygonal line $\bar{P}$ (see \cite{Insel99a} for a recent survey). Earlier \cite{inselberg85plane}, a surface $σ$ was represented as the {\em envelope} of the polygonal lines representing it's points. This is ambiguous in the sense that {\em different} surfaces can provide the {\em same} envelopes. Here the ambiguity is eliminated by considering the surface $σ$ as the envelope of it's {\em tangent planes} and in turn, representing each of these planes by $n$-1 points \cite{Insel99a}. This, with some future extension, can yield a new and unambiguous representation, $\barσ$, of the surface consisting of $n$-1 planar regions whose properties correspond lead to the {\em recognition} of the surfaces' properties i.e. developable, ruled etc. \cite{hung92smooth}) and {\em classification} criteria. It is further shown that the image (i.e. representation) of an algebraic surface of degree 2 in $\Real^n$ is a region whose boundary is also an algebraic curve of degree 2. This includes some {\em non-convex} surfaces which with the previous ambiguous representation could not be treated. An efficient construction algorithm for the representation of the quadratic surfaces (given either by {\em explicit} or {\em implicit} equation) is provided. The results obtained are suitable for applications, to be presented in a future paper, and in particular for the approximation of complex surfaces based on their {\em planar} images. An additional benefit is the elimination of the ``over-plotting'' problem i.e. the ``bunching'' of polygonal lines which often obscure part of the parallel-coordinate display.

cs.OH↗

Algebraic Curves in Parallel Coordinates - Avoiding the "Over-Plotting" Problem

${\cal U}$ntil now the representation (i.e. plotting) of curve in Parallel Coordinates is constructed from the point $\leftrightarrow$ line duality. The result is a ``line-curve'' which is seen as the envelope of it's tangents. Usually this gives an unclear image and is at the heart of the ``over-plotting'' problem; a barrier in the effective use of Parallel Coordinates. This problem is overcome by a transformation which provides directly the ``point-curve'' representation of a curve. Earlier this was applied to conics and their generalizations. Here the representation, also called dual, is extended to all planar algebraic curves. Specifically, it is shown that the dual of an algebraic curve of degree $n$ is an algebraic of degree at most $n(n - 1)$ in the absence of singular points. The result that conics map into conics follows as an easy special case. An algorithm, based on algebraic geometry using resultants and homogeneous polynomials, is obtained which constructs the dual image of the curve. This approach has potential generalizations to multi-dimensional algebraic surfaces and their approximation. The ``trade-off'' price then for obtaining {\em planar} representation of multidimensional algebraic curves and hyper-surfaces is the higher degree of the image's boundary which is also an algebraic curve in $\|$-coords.

cs.OH↗