Bulk execution of the dynamic programming for the optimal polygon triangulation problem on the GPU-Reference-Cited by-同舟云学术

Bulk execution of the dynamic programming for the optimal polygon triangulation problem on the GPU

Published:2018-09-14 Issue:19 Volume:31 Page:e4947
ISSN:1532-0626
Container-title:Concurrency and Computation: Practice and Experience
language:en
Short-container-title:Concurrency Computat Pract Exper

Author:

Yamashita Kohei¹,Ito Yasuaki¹^ORCID,Nakano Koji¹^ORCID

Affiliation:

1. Dependent of Information Engineering; Hiroshima University; Kagamiyama 1-4-1, Higashi-Hiroshima Hiroshima Japan

Publisher

Wiley

Subject

Computational Theory and Mathematics,Computer Networks and Communications,Computer Science Applications,Theoretical Computer Science,Software

Link

http://onlinelibrary.wiley.com/wol1/doi/10.1002/cpe.4947/fullpdf

Reference34 articles.

1. Yamashita K Ito Y Nakano K A GPU implementation of bulk execution of the dynamic programming for the optimal polygon triangulation 2017 Lublin, Poland

2. Bergroth L Hakonen H Raita T A survey of longest common subsequence algorithms 2000 A Coruña, Spain

3. Gilbert P New Results on Planar Triangulations Champaign, IL University of Illinois at Urbana-Champaign Applied Computation Theory Group Coordinated Science Laboratory 1979

4. Annals of Discrete Mathematics;Klincsek,1980

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Optimization Techniques for GPU Programming;ACM Computing Surveys;2023-03-16

2. Huffman Coding with Gap Arrays for GPU Acceleration;49th International Conference on Parallel Processing - ICPP;2020-08-17

3. Algorithmic advances in parallel architectures and energy‐efficient computing;Concurrency and Computation: Practice and Experience;2019-03-25

4. Bulk execution of the dynamic programming for the optimal polygon triangulation problem on the GPU;Concurrency and Computation: Practice and Experience;2018-09-14