Search

Emden R Gansner

from Morristown, NJ
Age ~73
Get Report
Also known as:
Emden T Gansner, Emden R Ganser
Phone and address:
8 Arrowhead Rd, Morristown, NJ 07960
(973) 538-3517
Related to:
Carmen M Diaz, 52E GansnerMarjorie B GansnerKaren E Gansner, 73Paulo L Lizano, 40Meredith E Gansner, 38
Connected to:
Adrian R Ganson, 55Don B Ganson, 70Amy L Gansrich, 36Ivonne H Ganss, 54Mary F Ganssle, 69Stephen Ganssle, 79Gary G Ganster, 63Gregory C Ganster, 76Maureen W Ganster, 77Paul W Ganster, 40

Emden Gansner Phones & Addresses

  • 8 Arrowhead Rd, Morristown, NJ 07960 (973) 538-3517
  • Saint Louis, MO

Resumes

Resumes

Emden Gansner Photo 1

Emden Gansner

View page
Location:
Birmingham, AL
Industry:
Telecommunications
Work:
AT&T Labs since 1996
Lead Member of Technical Staff
Bell Labs 1980 - 1996
Distinguished Member of Technical Staff
University of Illinois at Urbana-Champaign 1978 - 1980
Assistant Professor
Education:
Massachusetts Institute of Technology 1973 - 1978
PhD, Mathematics California Institute of Technology 1969 - 1973
BS, Mathematics
Skills:
Algorithms
Software Development
Software Engineering
Computer Science
Java
C
Machine Learning
C++
Linux
Programming
Unix
Shell Scripting
Research
Data Mining
Python
System Architecture
Information Visualization
Information Graphics
Javascript
Graph Algorithms
Html
Xml
Oop
Interests:
Classical Music
Cooking
Gardening
Discrete Math
Computationall Geometry
Hiking
Languages:
English
French
Emden Gansner Photo 2

Emden Gansner

View page

Publications

Us Patents

System And Method For Large-Scale Data Visualization

View page
US Patent:
7454439, Nov 18, 2008
Filed:
Nov 24, 2000
Appl. No.:
09/721884
Inventors:
Emden Gansner - Morristown NJ, US
Eleftherios Koutsofios - Chatham NJ, US
Stephen Charles North - Lebanon NJ, US
Russell N. Truscott - Bethlehem PA, US
Assignee:
AT&T Corp. - New York NY
International Classification:
G06F 7/00
US Classification:
7071041, 715264
Abstract:
The present invention is directed to a new visualization platform for the interactive exploration of large datasets. The present invention integrates a collection of relevant visualization techniques to provide a new visual metaphor for viewing large datasets. It is capable of providing comprehensive support for data exploration, integrating large-scale data visualization with querying, browsing, and statistical evaluation. A variety of techniques are utilized to minimize processing delays and the use of system resources, including processing pipelines, direct IO, memory mapping, and dynamic linking of “on-the-fly” generated code.

System And Method For Generating Circular Layout Graphs

View page
US Patent:
7656405, Feb 2, 2010
Filed:
May 10, 2007
Appl. No.:
11/746756
Inventors:
Emden Gansner - Morristown NJ, US
Yehuda Koren - Elizabeth NJ, US
Assignee:
AT&T Corp. - New York NY
International Classification:
G06T 11/20
US Classification:
345440, 715734
Abstract:
A system and method for identifying a plurality of nodes for a circular layout, each of the plurality of nodes to be connected via an edge to at least one other of the plurality of nodes, fixing all of the plurality of nodes on a unit circle, except for one of the nodes, moving the unfixed node to a barycenter of the fixed plurality of nodes, projecting the unfixed node to the unit circle of the circular layout and displaying the circular layout.

System And Method For Generating Circular Layout Graphs

View page
US Patent:
7889200, Feb 15, 2011
Filed:
Dec 15, 2009
Appl. No.:
12/638169
Inventors:
Emden Gansner - Morristown NJ, US
Yehuda Koren - Elizabeth NJ, US
Assignee:
AT&T Intellectual Property II, L.P. - Reno NV
International Classification:
G06T 11/20
US Classification:
345440, 715734
Abstract:
A system and method for identifying a plurality of nodes for a circular layout, each of the plurality of nodes to be connected via an edge to at least one other of the plurality of nodes, fixing all of the plurality of nodes on a unit circle, except for one of the nodes, moving the unfixed node to a barycenter of the fixed plurality of nodes, projecting the unfixed node to the unit circle of the circular layout and displaying the circular layout.

Methods, Systems, And Products For Graphing Data

View page
US Patent:
20100149186, Jun 17, 2010
Filed:
Dec 11, 2008
Appl. No.:
12/332477
Inventors:
Emden R. Gansner - Morristown NJ, US
Yifan Hu - Mountain Lakes NJ, US
International Classification:
G06T 11/20
US Classification:
345440
Abstract:
Methods, systems, and products are disclosed for graphing data. A layout is retrieved that comprises locations for vertices. A proximity graph is generated using triangulation. Nodal overlaps are removed.

Visualization And Representation Of Data Clusters And Relations

View page
US Patent:
20110134128, Jun 9, 2011
Filed:
Dec 8, 2009
Appl. No.:
12/633233
Inventors:
Yifan Hu - Mountain Lakes NJ, US
Emden Gansner - Morristown NJ, US
Stephen Kobourov - Tucson AZ, US
Christopher T. Volinsky - Morristown NJ, US
Assignee:
AT&T Intellectual Property I, L.P. - Reno NV
International Classification:
G06T 11/20
US Classification:
345440
Abstract:
Relational data can be visualized in a map representation. A plurality of vertices and edges are determined based on a set of data identifying objects (i.e., vertices) and relationships (i.e., edges). The vertices and edges are embedded in a planar graph and a Voronoi diagram is generated based at least the plurality of vertices within a set of bounding-points located at least a distance away from the vertices of the map. A bounding-box is associated with each of the vertices, and a set of points generated along each bounding-box. The Voronoi diagram is generated based on the vertices and the set of points of each bounding-box. Each resulting Voronoi cell associated with a common vertex is merged to form a plurality of common cells (i.e., map). The size of each bounding-box can correlate to the importance of its associated vertex, and the points along the bounding-box can be randomly perturbed.

Technique For Drawing Directed Graphs

View page
US Patent:
49531069, Aug 28, 1990
Filed:
May 23, 1989
Appl. No.:
7/355731
Inventors:
Emden R. Gansner - Morristown NJ
Stephen C. North - Califon NJ
Assignee:
AT&T Bell Laboratories - Murray Hill NJ
International Classification:
G06F 314
US Classification:
364521
Abstract:
The present invention relates to a computer-implemented technique for drawing directed graphs providing reduced crossings and improved picture quality. An edge list description provided by a user is processed to produce a ranking of all nodes that minimizes the weighted sum of all edges, an edge cost being the product of its weight and length. Nodes within a ranking are then positioned to reduce edge crossings using a heuristic based on node positions in adjacent ranks. Such heuristic uses a generalized median as a weighting function plus node transposition to avoid senseless edge crossings before proceeding to a next rank. Nodes are then positioned to minimize the weighted sum of horizontal distances among connected nodes. Spline control points are then computed for interconnected nodes, and a code sequence for a drawing is generated.
Control profile
Emden R Gansner from Morristown, NJ, age ~73 Get Report