Scholars Central

Research articlePublished 31 May 2014

Several optimization strategies for CDT algorithm

Authors: Haiying Sun, Liang Ma

Journal of Chemical and Pharmaceutical Research

Volume 6 · Issue 5 · Pages 279–283

Ask about this article

Abstract

Select any words in the title or abstract, or press this and choose a sentence.

iThe Constrained Delaunay Triangulation is one of the most typical algorithm in computer graphics. But it still has some limitation. Thus we want to do some changes to make it more efficient. Our main work can be divided into two parts. Firstly, we design a algorithm to improve its readability and execution efficiency. In this part, we adapt the thought of polygon’s successive division and create a polygon class, for this mainly using C++ and OpenGL languages to realize. Secondly, we design another algorithm to expand its application scope. Main thought is the cross determination for selecting the eligible diagonals. Experiment showed we have achieved expectation effect to some extent.

Ask about this article

Answers come only from this article's title, abstract and keywords, each sentence pointing to where it comes from. Your question is sent to OpenAI to write the answer. Scholars Central does not store it.

Try:

Similar by topic

More from this journal

The newest in Journal of Chemical and Pharmaceutical Research.

All its articles

Conferences in this field

Upcoming conferences in this field.

Follow

New articles from what you follow go into your email digest, once you agree to alert emails.

  • JournalJournal of Chemical and Pharmaceutical Research
  • SubjectPharmaceutical Sciences
  • SubjectChemistry
  • BylineArticles whose byline prints “Haiying Sun”
  • BylineArticles whose byline prints “Liang Ma”

For authors and organisers

Publish, present and keep up with your field

Find the right journal for your paper and submit your manuscript.

Photo: Pexels