On the Difficulty of Embedding Planar Graphs with Inaccuracies

No abstract is available for this paper.

• Publication year

  1994

• Venue

  International Symposium Graph Drawing and Network Visualization

• Publication date

  1994-10-10

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/3-540-58950-3_377
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Fixed edge-length graph drawing is NP-hard

  1990cited by this paper
• A simplified NP-complete satisfiability problem

  1984influential reference
• Planar Formulae and Their Uses

  1982influential reference
• The complexity of theorem-proving procedures

  1971cited by this paper

• Simply Realising an Imprecise Polyline is NP-hard

  2023cites this paper
• Drawing Clustered Planar Graphs on Disk Arrangements

  2020cites this paper
• Geometric Graph Drawing Algorithms - Theory, Engineering and Experiments

  2020cites this paper
• Drawing Clustered Graphs on Disk Arrangements

  2018cites this paper
• Tradeoffs between Bends and Displacement in Anchored Graph Drawing

  2015cites this paper
• Anchored Drawings of Planar Graphs

  2014cites this paper
• Partial Matching between Surfaces Using Fréchet Distance

  2012cites this paper
• Embedding the dual complex of hyper-rectangular partitions

  2012influential citation
• Guarding Rectangular Partitions

  2009cites this paper
• University of Groningen Convex Approximation by Spherical Patches

  2008cites this paper
• Convex Approximation by Spherical Patches

  2007cites this paper
• Algorithms for Complex Shapes with Certified Numerics and Topology Spherical approximation of convex shapes

  2007influential citation
• Journal of Graph Algorithms and Applications Fixed-location Circular Arc Drawing of Planar Graphs * †

  year unknowncites this paper