Login / Signup

Computing Simple Circuits from a Set of Line Segments is NP-Complete.

David Rappaport
Published in: SCG (1987)
Keyphrases
  • line segments
  • np complete
  • straight line segments
  • polynomial time complexity
  • computational complexity
  • image set
  • ellipse detection
  • object recognition
  • lower bound
  • np hard
  • satisfiability problem
  • randomly generated