Login / Signup

Minimum Number of Pieces in a Convex Partition of a Polygonal Domain.

Horst MartiniValeriu Soltan
Published in: Int. J. Comput. Geom. Appl. (1999)
Keyphrases
  • small number
  • memory requirements
  • case study
  • computational complexity
  • database
  • data sets
  • learning algorithm
  • information systems
  • data structure
  • feature space
  • linear programming