AI Chat AI Image Generator AI Video Text to Speech

3-Colorable Delaunay Triangulations

12/24/2018

∙

by Lucas Moutinho Bueno, et al.

∙

∙

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.

page 1

page 2

page 3

page 4

research

∙ 05/13/2022

On Fekete Points for a Real Simplex

We survey what is known about Fekete points/optimal designs for a simple...

0 Len Bos, et al. ∙

research

∙ 10/27/2019

Computing a Geodesic Two-Center of Points in a Simple Polygon

Given a simple polygon P and a set Q of points contained in P, we consid...

0 Eunjin Oh, et al. ∙

research

∙ 03/20/2013

Why Do We Need Foundations for Modelling Uncertainties?

Surely we want solid foundations. What kind of castle can we build on sa...

0 Henry E. Kyburg Jr, et al. ∙

research

∙ 04/09/2019

A Fast and Efficient algorithm for Many-To-Many Matching of Points with Demands in One Dimension

Given two point sets S and T, we first study the many-to-many matching w...

0 Fatemeh Rajabi-Alni, et al. ∙

research

∙ 12/16/2021

Improving scripts with a memory of natural feedback

How can an end-user provide feedback if a deployed structured prediction...

0 Niket Tandon, et al. ∙

research

∙ 04/08/2023

Convex Hulls: Surface Mapping onto a Sphere

Writing an uncomplicated, robust, and scalable three-dimensional convex ...

0 Ben Kenwright, et al. ∙

research

∙ 11/17/2009

Apply Ant Colony Algorithm to Search All Extreme Points of Function

To find all extreme points of multimodal functions is called extremum pr...

0 Chao-Yang Pang, et al. ∙