Abstract
In this paper parallel implementations of the Optimal Triangularization Problem are presented using Dynamic Programming Approach. Experimental results with respect to speedup as a function of the polygon size are given. Dynamic Programming implementation is compared with brute force approach from performance perspective. Actor-based parallel implementations are discussed.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Hao Hsueh, Actor-based Parallel Implementations of the Polygon Triangularization Problem Master Thesis, Computer and Information Science Department, University of Massachusetts, Dartmouth, 2000.
Sedgewick, Robert. 2nd ed. Algorithms Reading, MA: Addison-Wesley Publishing Company, 1988.
Shatz, Sol M. Development of Distributed Software Concepts and Tools. New York: Mac Millan Publishing Company, 1993.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hsueh, H., Mikolajczak, B. (2001). Intelligent Computing Systems with Actors — Parallel Dynamic Programming Algorithm of the Polygon Triangulation Problem. In: Kłopotek, M.A., Michalewicz, M., Wierzchoń, S.T. (eds) Intelligent Information Systems 2001. Advances in Intelligent and Soft Computing, vol 10. Physica, Heidelberg. https://doi.org/10.1007/978-3-7908-1813-0_21
Download citation
DOI: https://doi.org/10.1007/978-3-7908-1813-0_21
Publisher Name: Physica, Heidelberg
Print ISBN: 978-3-7908-1407-1
Online ISBN: 978-3-7908-1813-0
eBook Packages: Springer Book Archive