Please use this identifier to cite or link to this item: http://repository.unmul.ac.id/handle/123456789/4122
Full metadata record
DC FieldValueLanguage
dc.contributor.authorMaria, E.-
dc.contributor.authorBudiman, Edy-
dc.contributor.authorHaviluddin, Haviluddin-
dc.contributor.authorTaruk, Medi-
dc.date.accessioned2020-04-10T12:23:34Z-
dc.date.available2020-04-10T12:23:34Z-
dc.date.issued2020-04-10-
dc.identifier.issn1742-6596-
dc.identifier.urihttp://repository.unmul.ac.id/handle/123456789/4122-
dc.description.abstractThe application of finding the nearest public facility using 2 methods to measure the distance between 2 points, i.e. the Euclidean Method and the Haversine Formula. Euclidean is a heuristic function obtained based on direct distance without obstacles such as to get the value of the length of a diagonal line on a triangle. Whereas Haversine is an equation that looks for the distance of an arc between two points on longitude and latitude. The results of the calculation of the average distance Euclidean deviations with an average value of data 2.539764, and Haversine 2.536912. This shows that the comparison of the measurements of the distance between Euclidean and Haversine has a difference of 0.002852 or the percentage of the distance between the two methods is 99.89 percent. Of the two methods, which yield values almost by measurements on Google maps is Haversine. For Euclidean, it is used to measure the distance between two points on a flat plane so that the results have differences when compared to the Haversine formula.en_US
dc.language.isoenen_US
dc.publisherIOP - Journal of Physics: Conference Seriesen_US
dc.subjectHarvesine; Euclidean; nearest public facilities; google mapsen_US
dc.titleMeasure distance locating nearest public facilities using Haversine and Euclidean Methodsen_US
dc.typeArticleen_US
Appears in Collections:P - Computer Sciences and Information Technology

Files in This Item:
File Description SizeFormat 
Artikel-JPCS2020-Measure_distance_locating.pdf1.04 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.