Closest Pair Solver

CompSci In Browser Golang Typescript Algorithm Three.js Docker Cloudflare AWS EC2 Web Vite TailwindCSS Websocket CI/CD Github Actions

Github Repository:
https://github.com/cadevue/closest-pair-solver

Try Now!

This application can be tried out immediately! The web application can be accessed in this link:
https://closest-pair-frontend.pages.dev/

Project Description

A web application that solve the closest pair problem using 2 kind of algorithm — Brute Force and Divide and Conquer. The application shows the comparison between the two algorithms in terms of execution time and number of Euclidean operations needed to solve the problem.

The frontend is built using Typescript and Three.js, while the backend is built using Golang. The program is deployed using Cloudflare Pages (frontend) and Docker-AWS EC2 (backend). The communication between the frontend and backend is done using websocket.

Here is the specification of the request and response for the websocket communication:

type SolveCPRequest struct {
	Method    string    `json:"method"`
	Dimension int32     `json:"dimension"`
	Points    []float64 `json:"points"`
}

type SolveCPResponse struct {
	Method            string   `json:"method"`
	Indexes           [2]int32 `json:"indexes"`
	Distance          float64  `json:"distance"`
	NumOfEuclideanOps int64    `json:"numOfEuclideanOps"`
	ExecutionTime     float64  `json:"executionTime"`
}