Article Per Year (5 Year)
p-Index From 2020 - 2025
0.23
P-Index
This Author published in this journals
All Journal d'Cartesian: Jurnal Matematika dan Aplikasi
Luther A. Latumakulita
Sam Ratulangi University
Mathematics

Published : 2 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 2 Documents
Search

 1 
Designing an Auto Cropping Application System for Fish Eye Image Using the Edge Detection Method Brian Sulu; Jullia Titaley; Luther A. Latumakulita; Altien J. Rindengan
d\'Cartesian: Jurnal Matematika dan Aplikasi Vol. 8 No. 2 (2019): September 2019
Publisher : Sam Ratulangi University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.35799/dc.8.2.2019.24255

Abstract

Indonesia is one of the largest archipelagic countries in the world with the ocean area is larger than the mainland. This potential provides a great opportunity to do research in the maritime sector. The purpose of this research is to develop the application system that can automatically recognize and separate the fisheye images using the edge detection method. By using 20 fish digital images which taken by digital camera, the application system can recognize and separate the fisheye characteristic features with a good accuracy of 90%.
GUI Application to Setup Simple Graph on the Plane using Tkinter of Python Gery Josua Sumual; Benny Pinontoan; Luther A. Latumakulita
d\'Cartesian: Jurnal Matematika dan Aplikasi Vol. 10 No. 1 (2021): Maret 2021
Publisher : Sam Ratulangi University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.35799/dc.10.1.2021.32138

Abstract

In graph theory, drawing a simple graph on the plane might result an intersection of pair of edges that is not intended as a vertex called crossing. The least amount of crossing in any simple drawing of a graph is the crossing number of that graph, 𝑐𝑟(𝐺). Given a graph G and an integer 𝐾, the general problem to proof 𝑐𝑟(𝐺) ≤ 𝐾 is an NP-Complete problem, which means, it is likely intractable. One of the way to proof 𝑐𝑟(𝐺) ≤ 𝐾 is by showing the drawing of graph 𝐺 with 𝐾 number of crossing; doing it with a computer application can be much of help. Therefore, the purpose of our research is to create one using Tkinter of Python. The development of the application is feature driven. The developed features are used to find any simple drawing of graphs on the plane. As the result, the application can proof 𝑐𝑟(𝐾_3,3) ≤ 1, 𝑐𝑟(𝐾_6) ≤ 3, and 𝑐𝑟(𝐾𝐺_5,2) ≤ 2.
Co-Authors Altien J. Rindengan Benny Pinontoan Brian Sulu Gery Josua Sumual Jullia Titaley