Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Martin Menzel

dblp:98/4993 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 1998
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 1Human-computer interaction and ubiquitous computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer graphics and multimedia
1 paper
Visualization and visual analytics · 100%
Theoretical computer science
1 paper
Computational geometry · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Visualization and visual analytics
flow visualization
0.011998
Visualizing Nonlinear Vector Field Topology · IEEE Trans. Vis. Comput. Graph. 1998
Visualization and visual analytics › topological data analysis
vector field topology
0.011998
Visualizing Nonlinear Vector Field Topology · IEEE Trans. Vis. Comput. Graph. 1998
Computational geometry
clifford algebra
0.011998
Visualizing Nonlinear Vector Field Topology · IEEE Trans. Vis. Comput. Graph. 1998

Methods — techniques the papers use, named apart from their topics

polynomial approximation · 0.0piecewise linear approximation · 0.0clifford algebra · 0.0
YearPublicationVenuePosition
1998 Visualizing Nonlinear Vector Field Topology
abstract
We present our results on the visualization of nonlinear vector field topology. The underlying mathematics is done in Clifford algebra, a system describing geometry by extending the usual vector space by a multiplication of vectors. We started with the observation that all known algorithms for vector field topology are based on piecewise linear or bilinear approximation, and that these methods destroy the local topology if nonlinear behavior is present. Our algorithm looks for such situations, chooses an appropriate polynomial approximation in these areas, and, finally, visualizes the topology. This overcomes the problem, and the algorithm is still very fast because we are using linear approximation outside these small but important areas. The paper contains a detailed description of the algorithm and a basic introduction to Clifford algebra.
Gerik Scheuermann, Heinz Krüger, Martin Menzel, Alyn P. Rockwood
IEEE Trans. Vis. Comput. Graph.3
1997 Visualization of higher order singularities in vector fields
abstract
Presents an algorithm for the visualization of vector field topology based on Clifford algebra. It allows the detection of higher-order singularities. This is accomplished by first analysing the possible critical points and then choosing a suitable polynomial approximation, because conventional methods based on piecewise linear or bilinear approximation do not allow higher-order critical points and destroy the topology in such cases. The algorithm is still very fast, because of using linear approximation outside the areas with several critical points.
Gerik Scheuermann, Hans Hagen, Heinz Krüger, Martin Menzel, Alyn P. Rockwood
IEEE Visualization4