# 3-Colorable Delaunay Triangulations

## TL;DR

This paper introduces an algorithm for constructing a 3-colorable Delaunay triangulation by adding a minimal number of new points to a given set, ensuring the triangulation's colorability.

## Contribution

The paper presents a novel algorithm that efficiently produces a 3-colorable Delaunay triangulation with minimal augmentation of the point set.

## Key findings

- Algorithm successfully creates 3-colorable triangulations
- Minimizes the number of added points
- Applicable to various point configurations

## Abstract

We propose an algorithm to create a 3-colorable Delaunay Triangulation. The input of the problem we are trying to solve is a set X of n twodimensional points. The output is a 3-colorable two-dimensional Delaunay triangulation T for X U Y , where Y is a set of m new points. We want to m be as few as possible.