A HYBRID ALGORITHM FOR TERRAIN SIMPLIFICATION

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

DABAGHI ZARANDI F.; GHODSI M.

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: NASHRIYYAH -I MUHANDISI -I BARQ VA MUHANDISI -I KAMPYUTAR -I IRAN, B- MUHANDISI -I KAMPYUTAR Year:2014 | Volume:12 | Issue:1 Page(s): 12-22

Download Full-Text

Persian Verion

View:

1,372

Download:

Cites:

Information Journal Paper

Title

A HYBRID ALGORITHM FOR TERRAIN SIMPLIFICATION

Author(s)

DABAGHI ZARANDI F. | GHODSI M. | Issue Writer Certificate

Keywords

TERRAUNQ2

SIMPLIFICATIONQ2

TRIANGULATED IRREGULAR NETWORKSQ2

CLUSTERINGQ2

HYBRIDQ2

GREEDY ALGORITHMSQ2

Abstract

Terrain SIMPLIFICATION problem is one of fundamental problems in computational geometry and it has many applications in other fields such as geometric information systems, computer graphics, image processing. Terrain is commonly defined by a set of n points in three dimension space. Major goal of terrain SIMPLIFICATION problem is removing some points of one terrain so that maximum error of simplified surface is a certain threshold. There are two optimization goals for this problem: (1) min-k, where for a given error threshold e, the goal is to find a SIMPLIFICATION with the minimum number of points for which the error is that most e, and (2) min-e, where for a given number n, the goal is to find a SIMPLIFICATION of at most m points that has the minimum SIMPLIFICATION error. SIMPLIFICATION problem is NP-hard in optimal case.In this paper we present a HYBRID algorithm for terrain SIMPLIFICATION that performs in three phases. First, terrain is divided to some clusters, then any cluster is simplified independently and finally, the simplified clusters are merged. Our algorithm solves the problem in O (n2Ön). The proposed algorithm is implemented and verified by experiments.

Cites

No record.

References

No record.

Cite

APA: Copy

DABAGHI ZARANDI, F., & GHODSI, M.. (2014). A HYBRID ALGORITHM FOR TERRAIN SIMPLIFICATION. NASHRIYYAH -I MUHANDISI -I BARQ VA MUHANDISI -I KAMPYUTAR -I IRAN, B- MUHANDISI -I KAMPYUTAR, 12(1), 12-22. SID. https://sid.ir/paper/228405/en

Vancouver: Copy

DABAGHI ZARANDI F., GHODSI M.. A HYBRID ALGORITHM FOR TERRAIN SIMPLIFICATION. NASHRIYYAH -I MUHANDISI -I BARQ VA MUHANDISI -I KAMPYUTAR -I IRAN, B- MUHANDISI -I KAMPYUTAR[Internet]. 2014;12(1):12-22. Available from: https://sid.ir/paper/228405/en

IEEE: Copy

F. DABAGHI ZARANDI, and M. GHODSI, “A HYBRID ALGORITHM FOR TERRAIN SIMPLIFICATION,” NASHRIYYAH -I MUHANDISI -I BARQ VA MUHANDISI -I KAMPYUTAR -I IRAN, B- MUHANDISI -I KAMPYUTAR, vol. 12, no. 1, pp. 12–22, 2014, [Online]. Available: https://sid.ir/paper/228405/en

Related Journal Papers