# Computational Geometry Engineer Technical Challenge

Solution to the Computational Geometry Engineer Challenge

## Table of Contents

- [General Info](#general-info)
- [File Structure](#file-structure)
- [Usage](#usage)
- [Demo](#demo)
- [License](#license)

## General info

Given a set of vertices connected by edges, provided in a JSON data structure, write an algorithm that finds all of the interior faces (polygons) of such a data structure. The output schema should be a simple JSON format.

## File Structure

## Usage

```javascript

```

## Demo

[HA Engineering Challenge](https://ha-geometry-technical-challenge.netlify.app/)

## License

[MIT](https://choosealicense.com/licenses/mit/)