Login / Signup

Partitioning Orthogonal Polygons by Extension of All Edges Incident to Reflex Vertices: Lower and Upper Bounds on the Number of Pieces.

António Leslie BajuelosAna Paula TomásFábio Marques
Published in: ICCSA (3) (2004)
Keyphrases
  • lower and upper bounds
  • small number
  • random graphs
  • upper bound
  • edge detection
  • multiscale
  • computational complexity
  • lower bound
  • weighted graph
  • edge weights