@inbook{45eac321ea794dcaa470151eb89fd2e3,
title = "Optimal Convex Decompositions",
abstract = "The problem of decomposing a non-convex simple polygon into a minimum number of convex polygons is solved. The decomposition allows for the introduction of Steiner points. Two algorithms are proposed. The first verifies that the problem is doable in polynomial time. The second provides an efficient method. Along the way, numerous results of independent interest in pure geometry as well as geometric complexity are stated.",
author = "Bernard Chazelle and Dobkin, {David Paul}",
year = "1985",
month = jan,
day = "1",
doi = "10.1016/B978-0-444-87806-9.50009-8",
language = "English (US)",
series = "Machine Intelligence and Pattern Recognition",
number = "C",
pages = "63--133",
booktitle = "Machine Intelligence and Pattern Recognition",
edition = "C",
}