Login / Signup

A complete, exact and efficient implementation for computing the edge-adjacency graph of an arrangement of quadrics.

Michael HemmerLaurent DupontSylvain PetitjeanElmar Schömer
Published in: J. Symb. Comput. (2011)
Keyphrases
  • efficient implementation
  • adjacency graph
  • highly parallel
  • active set
  • hardware implementation
  • efficient processing
  • edge detection
  • genetic algorithm
  • dynamic programming
  • computational intelligence