NDLI: A parallel algorithm for binary-tree-based string rewriting in L-systems

Content Provider	IEEE Xplore Digital Library
Author	Tingjun Yang Zhengge Huang Xingsheng Lin Jianjun Chen Jun Ni
Copyright Year	2007
Description	Author affiliation: Zhejiang Univ., Hangzhou (Tingjun Yang; Zhengge Huang; Xingsheng Lin; Jianjun Chen)
Abstract	The L-system is a commonly used methodology to generate fractals and realistic model plants, yet it is very complex and computationally expensive. This paper presents a new parallel L-system string re-writing algorithm based on two types of binary tree: the growth-state tree (GST) and the growth-manner tree (GMT). This data structure makes one of the basic operations in the L-system - left and right context searching - extremely easy during the process of growth-state evolvement. Another benefit from this data structure is that we can make use of pseudo nodes to store information about neighboring sub-strings after each string partition. This helps working processes, in both the stage of growth and rendering, communicate well with each other so as to accomplish the final image compositions. Results of experimental tests have demonstrated that our parallel strategy works effectively on clusters with a multi-processors architecture.
Starting Page	245
Ending Page	252
File Size	139575
Page Count	8
File Format	PDF
ISBN	9780769530390
DOI	10.1109/IMSCCS.2007.96
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2007-08-13
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Concurrent computing Computer science Layout Binary trees Computer graphics Rendering (computer graphics) Data structures Educational institutions Fractals Parallel algorithms
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Creating a Forest of Binary Search Trees for a Multiprocessor System

Bus-Based Tree Structures for Efficient Parallel Computation

Partition-Based Parallel Constructing-Density-Tree Clustering

Data-Parallel R-Tree Algorithms

A data distributed, parallel algorithm for ray-traced volume rendering

Concurrent search and insertion in K-Dimensional Height Balanced Trees

Adaptive dictionary matching

Real-Time Rendering of Highly Complex Dynamic Scenes Based on Parallel Multi-Core Architectures

The Research on Parallel Algorithm of A-order in Binary Tree Based on PRAM Model

A parallel algorithm for binary-tree-based string rewriting in L-systems

Similar Documents

Creating a Forest of Binary Search Trees for a Multiprocessor System

Bus-Based Tree Structures for Efficient Parallel Computation

Partition-Based Parallel Constructing-Density-Tree Clustering

Data-Parallel R-Tree Algorithms

A data distributed, parallel algorithm for ray-traced volume rendering

Concurrent search and insertion in K-Dimensional Height Balanced Trees

Adaptive dictionary matching

Real-Time Rendering of Highly Complex Dynamic Scenes Based on Parallel Multi-Core Architectures

The Research on Parallel Algorithm of A-order in Binary Tree Based on PRAM Model

A parallel algorithm for binary-tree-based string rewriting in L-systems