Skip to content

Latest commit

 

History

History
74 lines (63 loc) · 1.54 KB

README.md

File metadata and controls

74 lines (63 loc) · 1.54 KB
Raw

Tugas Kecil 2 - Closest Pair

Program that finds the closest pair(s) of points in d-dimensions with divide and conquer algorithm.

Table of Contents

General Information

Within set of points in d-dimensions, we could find the closest pair of points using brute force or divide and conquer algorithm. This program uses divide and conquer to find the closest pair(s) and the comparison with brute force algorithm.

Features

  • File input and output
  • 3D points visualization
  • Closest pair(s) in d-dimensions

Requirements

  • Python3
  • Matplotlib

How to Run

  1. Clone this repository 
$ git clone https://github.com/melvinkj/Tucil2_13521052_13521094.git
  1. Run the program by running this command in terminal 
$ python src/main.py

Program Structure

|   .gitignore
|   README.md
|
+---output
|       tc1.txt
|       tc10.txt
|       tc11.txt
|       tc12.txt
|       tc2.txt
|       tc3.txt
|       tc4.txt
|       tc5.txt
|       tc6.txt
|       tc7.txt
|       tc8.txt
|       tc9.txt
|
+---src
|       BruteForce.py
|       DivideAndConquer.py
|       IO.py
|       main.py
|       Utils.py
|   
|
\---test
        2d.txt
        3d.txt

Authors

NIM Nama
13521052 Melvin Kent Jonathan
13521094 Angela Livia Arumsari