Login / Signup

On the Number of Edges in Geometric Graphs Without Empty Triangles.

Crevel Bautista-SantiagoMarco A. HerediaClemens HuemerA. Ramírez-ViguerasCarlos SearaJorge Urrutia
Published in: Graphs Comb. (2013)
Keyphrases
  • small number
  • computational complexity
  • undirected graph
  • weighted graph
  • image segmentation
  • directed edges
  • computer vision
  • bayesian networks
  • lower bound
  • geometric constraints
  • graph partitioning