Can I read Hertel-Mehlhorn Algorithm for Convex Polygons on EtoBox?

Hertel-Mehlhorn Algorithm for Convex Polygons by mehdi kamali is a document available to read on EtoBox.

What is Hertel-Mehlhorn Algorithm for Convex Polygons about?

The document discusses triangle partitioning and convex partitioning algorithms. It introduces the linear time triangle partitioning algorithm developed by Chazelle in 1991. Randomized triangle partitioning and the Seidel algorithm are described. Convex partitioning is introduced as a special case of partitioning into convex polygons. The goals and tradeoffs of convex partitioning are outlined. Optimal convex partitioning is discussed along with the Hertel-Mehlhorn algorithm for convex partitioning in linea

Author

mehdi kamali

Language

EN