147
click to vote
COMGEO
2006
ACM
15 years 3 months ago
2006
ACM
We introduce series-triangular graph embeddings and show how to partition point sets with them. This result is then used to prove an upper bound on the number of Steiner points nee...