On the Computational Complexity of Partitioning Weighted Points into a Grid of Quadrilaterals.

Alexander Idelberger Maciej Liskiewicz

Published in: CCCG (2014)

Keyphrases

computational complexity
grid points
np complete
point sets
special case
grid computing
data points
computational efficiency
low complexity
weighted sum
high computational complexity
multiscale
endpoints
neighborhood sequences
spectral graph
convex hull