Huffman Tree Visualization

2012 ◽  
Vol 468-471 ◽  
pp. 1883-1886
Author(s):  
Xiao Bo Yang ◽  
Bang Ze Chen
Keyword(s):  
Binary Tree ◽  
Path Length ◽  
Object Oriented ◽  
Visual Image ◽  
Huffman Coding ◽  
Object Oriented Method ◽  
Complete Binary Tree ◽  
Coding Method ◽  
Lossless Data Compression ◽  
Tree Visualization

Huffman tree is also called the optimal binary tree, is a kind of weighted shortest path length of the binary tree; Huffman coding is a coding method, which is used for a lossless data compression entropy coding ( right encoding ) optimal coding method. The realization of Huffman tree visualization is of great significance, this paper uses the object-oriented method, using a complete binary tree of Huffman tree visualization, visual image display of the Huffman coding process.

Binary Sort Tree Visualization Demonstration System Design and Realization

2012 ◽  
Vol 524-527 ◽  
pp. 3845-3848
Author(s):  
Xiao Bo Yang ◽  
Bang Ze Chen
Keyword(s):  
System Design ◽  
Binary Tree ◽  
Object Oriented ◽  
Object Oriented Method ◽  
Complete Binary Tree ◽  
Important Significance ◽  
Tree Visualization

Binary sort tree is a special binary tree, can be used for sorting and searching area, realize the visualization has important significance. In this paper ,it is realized the visualization of binary sort tree by using object-oriented method and the features of complete binary tree, solve some problems when the method achieved.

The Application of Bezier Curves about the Visualization of the Threaded Binary Tree

2012 ◽  
Vol 605-607 ◽  
pp. 2297-2300
Author(s):  
Xiao Bo Yang ◽  
Bang Ze Chen
Keyword(s):  
Real Time ◽  
Binary Tree ◽  
Object Oriented ◽  
Component Technology ◽  
Bézier Curve ◽  
Bezier Curve ◽  
Object Oriented Method ◽  
Complete Binary Tree ◽  
Interactive Performance ◽  
Com Component

In view of the characteristics of threaded binary tree and visualization of the problem,,it is realized the visualization of binary tree by using object-oriented method and the features of complete binary tree, and then achieved the visualization of threaded binary tree by using the COM component technology and the Bezier curve. This makes the tree related operations more intuitive, nice interactive performance, real-time.

scholarly journals Huffman Encoding using VLSI

2012 ◽  
pp. 143-145
Author(s):  
Shilpa.K. Meshram ◽  
Meghana .A. Hasamnis
Keyword(s):  
Binary Tree ◽  
Input Data ◽  
Huffman Coding ◽  
Specific Method ◽  
Prefix Code ◽  
Huffman Encoding ◽  
Lossless Data Compression ◽  
Variable Length Coding ◽  
Entropy Encoding ◽  
Tree Method

Huffman coding is entropy encoding algorithm used for lossless data compression. It basically uses variable length coding which is done using binary tree method. In our implementation of Huffman encoder, more frequent input data is encoded with less number of binary bits than the data with less frequency.This way of coding is used in JPEG and MPEG for image compression. Huffman coding uses a specific method for choosing the representation for each symbol, resulting in a prefix code. Prefix-free codes means the bit string representing some particular symbol is never a prefix of the bit string representing any other symbol.

The Shortest Path Algorithm Dynamic Visualization Realization

2013 ◽  
Vol 694-697 ◽  
pp. 2291-2294
Author(s):  
Xiao Bo Yang ◽  
Bang Ze Chen
Keyword(s):  
Shortest Path ◽  
Implementation Process ◽  
Object Oriented ◽  
Visual Image ◽  
The Other ◽  
Dynamic Visualization ◽  
Object Oriented Method ◽  
Shortest Path Algorithm ◽  
Source Point ◽  
The Right

By using object oriented method design graph vertices into class, and in this foundation to increase visual member, realize from the source point to the other vertex of the shortest path algorithm of dynamic visualization. Around the two sync window animation, the left window with thick lines drawn through the vertices and edges, " revealed the source point to the other vertex of the shortest path " list box display shortest path sequence and path length, the right window demonstration algorithm dynamic implementation process, and in the " S " text box to display the current most find shortest path vertices. The system has friendly interface, visual image.

Two Models of Additional Adjacencies between the Root and Descendants in a Complete Binary Tree Minimizing Total Path Length

2009 ◽  
Author(s):  
Kiyoshi Sawada ◽  
Sio-Iong Ao ◽  
Alan Hoi-Shou Chan ◽  
Hideki Katagiri ◽  
Osca Castillo ◽  
...  
Keyword(s):  
Binary Tree ◽  
Path Length ◽  
Complete Binary Tree ◽  
Total Path Length

Design and Implementation of Operation Limited Linear List Visualization Demo System

2013 ◽  
Vol 734-737 ◽  
pp. 3114-3118
Author(s):  
Xiao Bo Yang ◽  
Bang Ze Chen
Keyword(s):  
Object Oriented ◽  
Visual Image ◽  
Object Oriented Method ◽  
Design And Implementation ◽  
Linear List

Using object-oriented method operation limited linear list node is designed into the node class, and on this basis to increase visual members, realize the visualization demo system sequence stack, chain stack , circular queue and link queue. The system has friendly interface, visual image.

Sign in / Sign up

Export Citation Format

Share Document