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

Creon Levit

dblp:50/1100 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
0since 2021 · last 1999
—ORCID · none

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

Human-computer interaction and ubiquitous computing · 2Systems, architecture and hardware · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 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 · 67% Image and video processing · 33%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
High-performance computing · 77% Parallel and multicore computing · 23%
Theoretical computer science
1 paper
Algorithms and data structures · 100%

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

TopicWeightPapersLastEvidence papers
Image and video processing
feature extraction
0.011999
Feature Extraction of Separation and Attachment Lines · IEEE Trans. Vis. Comput. Graph. 1999
Visualization and visual analytics
scientific visualization
0.011999
Feature Extraction of Separation and Attachment Lines · IEEE Trans. Vis. Comput. Graph. 1999
Visualization and visual analytics › topological data analysis
vector field topology
0.011999
Feature Extraction of Separation and Attachment Lines · IEEE Trans. Vis. Comput. Graph. 1999
High-performance computing › numerical linear algebra
parallel linear algebra
0.011989
Parallel solution of pentadiagonal systems using generalized odd-even elimination · SC 1989
Algorithms and data structures
parallel algorithms
0.011989
Parallel solution of pentadiagonal systems using generalized odd-even elimination · SC 1989
Parallel and multicore computing › parallel algorithms
parallel algorithm design
0.011989
Parallel solution of pentadiagonal systems using generalized odd-even elimination · SC 1989

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

locally linear function · 0.0eigenvalue analysis · 0.0odd-even elimination · 0.0
YearPublicationVenuePosition
1999 Feature Extraction of Separation and Attachment Lines
abstract
Separation and attachment lines are topologically significant curves that exist on 2D surfaces in 3D vector fields. Two algorithms are presented, one point-based and one element-based, that extract separation and attachment lines using eigenvalue analysis of a locally linear function. Unlike prior techniques based on piecewise numerical integration, these algorithms use robust analytical tests that can be applied independently to any point in a vector field. The feature extraction is fully automatic and suited to the analysis of large-scale numerical simulations. The strengths and weaknesses of the two algorithms are evaluated using analytic vector fields and also results from computational fluid dynamics (CFD) simulations. We show that both algorithms detect open separation lines-a type of separation that is not captured by conventional vector field topology algorithms.
David N. Kenwright, Chris Henze, Creon Levit
IEEE Trans. Vis. Comput. Graph.3
1991 The Virtual Windtunnel: An Environment for the Exploration of Three-Dimensional Unsteady Flows
abstract
A recently completed implementation of a virtual environment for exploring numerically generated three-dimensional unsteady flowfields is described. A boom-mounted six-degree-of-freedom head-position-sensitive stereo CRT system is used for viewing. A hand-position-sensitive glove controller is used for injecting various tracers (e.g. smoke) into the virtual flowfield. A multiprocessor graphics workstation is used for computation and rendering. The techniques for visualizing unsteady flows are described, and the computer requirements for a variety of visualization techniques are discussed. These techniques generalize to visualization of other 3D vector fields.>
Steve Bryson, Creon Levit
IEEE Visualization2
1991 A Tool for Visualizing the Topology of Three-Dimensional Vector Fields
abstract
A description is given of a software system, TOPO, that numerically analyzes and graphically displays topological aspects of a three-dimensional vector field, v, to produce a single, relatively simple picture that characterizes v. The topology of v considered consists of its critical points (where v=0), their invariant manifolds, and the integral curves connecting these invariant manifolds. The field in the neighborhood of each critical point is approximated by the Taylor expansion. The coefficients of the first nonzero term of the Taylor expansion around a critical point are the 3*3 matrix Delta v. Critical points are classified by examining Delta v's eigenvalues. The eigenvectors of Delta v span the invariant manifolds of the linearized field around a critical point. Curves integrated from initial points on the eigenvectors a small distance from a critical point connect with other critical points (or the boundary) to complete the topology. One class of critical surfaces that is important in computational fluid dynamics is analyzed.>
Al Globus, Creon Levit, T. Lasinski
IEEE Visualization2
1989 Parallel solution of pentadiagonal systems using generalized odd-even elimination
abstract
A new method for the solution of pentadiagonal systems of linear equations is presented. The method is a generalization of ordinary odd-even elimination used for tridiagonal systems. Using n processors, an n X n pentadiagonal system can be solved using the new method (generalized odd-even elimination) in time proportional to log2 n.
Creon Levit
SC1