All Questions

This question continues from: Cutting convex regions into equal diameter and equal least width pieces Definitions: The diameter of a convex region is the greatest distance between any pair of points ...

Question: Given an $N$-vertex polygon (not necessarily convex). It is to be cut into the least number of acute isosceles triangles. Based on this MathSE discussion, one can think of a method to get $\...

This is based on Chapter 6 of 'Convex figures' by Yaglom and Boltyanskii. This post also continues On two centers of convex regions. A point $P$ in the interior of a planar convex region $C$ divides ...

This is a followup question to this one: Computational Geometric Aspects of Greedy Tour Expansion. Assume that the candidate point, whose insertion into current incurs the least tour-length increase, ...