Minimum Length Embedding of Planar Graphs at Fixed Vertex Locations

DOI10.1007/978-3-319-03841-4_33MaRDI QIDQ2867674zbMATH OpenOpenAlexFDO

Authors Timothy M. Chan, Hella-Franziska Hoffmann, Stephen Kiazyk, Anna Lubiw

Publication date 20 December 2013

Published in Graph Drawing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-03841-4_33

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Recommendations

• Embedding planar graphs at fixed vertex locations
• On the complexity of embedding planar graphs to minimize certain distance measures
• Graph Drawing
• Planar Embeddings of Graphs with Specified Edge Lengths
• Embeddings of planar graphs that minimize the number of long-face cycles
• Minimal connected enclosures on an embedded planar graph
• On minimal-node-cost planar embeddings
• A new algorithm for embedding plane graphs at fixed vertex locations
• Minimally knotted embeddings of planar graphs
• scientific article; zbMATH DE number 1696626

Cited in

(16)

• Embeddings of planar graphs that minimize the number of long-face cycles
• A new algorithm for embedding plane graphs at fixed vertex locations
• Embedding ray intersection graphs and global curve simplification
• On minimizing the number of label transitions around a vertex of a planar graph
• Minimizing the number of label transitions around a nonseparating vertex of a planar graph
• Multi-sided boundary labeling
• Alternating paths and cycles of minimum length
• Retracting Graphs to Cycles
• Planar embeddability of the vertices of a graph using a fixed point set is NP-hard
• Planar Embeddings of Graphs with Specified Edge Lengths
• Algorithm Theory - SWAT 2004
• Minimum \(d\)-dimensional arrangement with fixed points
• On the complexity of embedding planar graphs to minimize certain distance measures
• Graph Drawing
• Inserting an edge into a geometric embedding
• Qubit mapping of one-way quantum computation patterns onto 2D nearest-neighbor architectures

This page was built for publication: Minimum Length Embedding of Planar Graphs at Fixed Vertex Locations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2867674)