Tucil 2 Stima 13522125 13522135 - Patan

Building a Bézier Curve with a Midpoint Algorithm based on Divide and Conquer and Brute force. Live demo here.

Table of Contents

• General Info
• Technologies Used
• Features
• Setup
• Project Status
• Room for Improvement
• Acknowledgements
• Contact

General Information

Bézier curves are smooth curves often used in graphic design, animation, and manufacturing. These curves are created by connecting several control points, which determine the shape and direction of the curve.

With building Bézier curves, we can learn about the algorithm used to create the curve, which is the Midpoint Algorithm. This algorithm is used to create a Bézier curve using the Divide and Conquer method and the Brute Force method. The Divide and Conquer method is a method that divides the problem into smaller subproblems, solves the subproblems, and then combines the solutions to the subproblems to solve the original problem. The Brute Force method is a method that solves the problem by trying all possible solutions and selecting the best solution.

Technologies Used

• HTML/CSS
• Javascript/Typescript
• ReactJS
• ChartJS
• TailwindCSS
• shadcn/ui
• Vite
• Vercel

Features

List the ready features here:

• Bézier Curve with Divide And Conquer
• Bézier Curve with Brute Force
• Enter iterations dynamically

Setup

Requirement

You need to have this

• npm
• nodejs

How to setup locally

• Clone this repository

git clone git@github.com:satriadhikara/Tucil2_13522125_13522135.git

• Install the required dependencies

npm install

• Run

npm run dev

Project Status

Project is: done

Room for Improvement

Room for improvement:

• Improve the ui

Acknowledgements

Give credit here.

• This project was based on this subject.

Contact

Created by

• Satriadhikara Panji Yudhistira - 13522125
• Christian Justin Hendrawan - 13522135