SEPARATING BICHROMATIC POINT SETS BY RIGHT TRIANGLES

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.

MOSLEHI Z.; BAGHERI A.R.

مرکز اطلاعات علمی 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:2015 | Volume:13 | Issue:2 Page(s): 158-164

Download Full-Text

Persian Verion

View:

1,041

Download:

Cites:

Information Journal Paper

Title

SEPARATING BICHROMATIC POINT SETS BY RIGHT TRIANGLES

Author(s)

MOSLEHI Z. | BAGHERI A.R. | Issue Writer Certificate

Keywords

COMPUTATIONAL GEOMETRYQ2

SEPARABILITY PROBLEMQ2

BICHROMATIC POINT SETQ2

RIGHT TRIANGLEQ2

MACHINE LEARNINGQ2

CLASSIFICATIONQ2

Abstract

Separating colored point sets is an interesting problem in COMPUTATIONAL GEOMETRY with application in MACHINE LEARNING and pattern recognition. In this problem, we are given a geometric shape C and two point sets P and Q of total size n as red and blue points, respectively. Now, we must separate red and blue points by this shape such that all the blue points lie inside it and all the red points lie outside it. In the previous work, we have some algorithms for rectangle and wedge separability but we do not have any algorithm for separating by a triangle and separating by a triangle with a fixed angle such as RIGHT TRIANGLE. In this paper, we present an efficient algorithm for RIGHT TRIANGLE seprability. In this algorithm, we use sweep line technique and introduce some events and process them. So, we can report all separating RIGHT TRIANGLEs in O (nlog n) time.

Cites

No record.

References

تفکیک پذیری سری نقاط دو رنگ با دو مستطیل مجزا و موازی محورهای مختصات

Cite

APA: Copy

MOSLEHI, Z., & BAGHERI, A.R.. (2015). SEPARATING BICHROMATIC POINT SETS BY RIGHT TRIANGLES. NASHRIYYAH -I MUHANDISI -I BARQ VA MUHANDISI -I KAMPYUTAR -I IRAN, B- MUHANDISI -I KAMPYUTAR, 13(2), 158-164. SID. https://sid.ir/paper/228545/en

Vancouver: Copy

MOSLEHI Z., BAGHERI A.R.. SEPARATING BICHROMATIC POINT SETS BY RIGHT TRIANGLES. NASHRIYYAH -I MUHANDISI -I BARQ VA MUHANDISI -I KAMPYUTAR -I IRAN, B- MUHANDISI -I KAMPYUTAR[Internet]. 2015;13(2):158-164. Available from: https://sid.ir/paper/228545/en

IEEE: Copy

Z. MOSLEHI, and A.R. BAGHERI, “SEPARATING BICHROMATIC POINT SETS BY RIGHT TRIANGLES,” NASHRIYYAH -I MUHANDISI -I BARQ VA MUHANDISI -I KAMPYUTAR -I IRAN, B- MUHANDISI -I KAMPYUTAR, vol. 13, no. 2, pp. 158–164, 2015, [Online]. Available: https://sid.ir/paper/228545/en

Related Journal Papers