On the Time Bound for Convex Decomposition of Simple Polygons.

J. Mark Keil Jack Snoeyink

Published in: Int. J. Comput. Geom. Appl. (2002)

Keyphrases

convex hull
data structure
lower bound
error bounds
minkowski sum
real time
data mining
decision trees
case study
worst case
convex optimization
piecewise linear
decomposition method
decomposition methods
minimum length
multicommodity flow problems