Login / Signup

Fast Compaction for Orthogonal Drawings with Vertices of Prescribed Size.

Markus EiglspergerMichael Kaufmann
Published in: Graph Drawing (2001)
Keyphrases
  • computational complexity
  • information retrieval
  • memory requirements
  • line drawings
  • neural network
  • e learning
  • website
  • clustering algorithm
  • database systems
  • lower bound
  • small size
  • engineering drawings