Drawing planar graphs on points inside a polygon

DOI10.1007/978-3-642-32589-2_18MaRDI QIDQ2912719zbMATH OpenOpenAlexFDO

Authors Peter Floderus, Therese Biedl

Publication date 25 September 2012

Published in Mathematical Foundations of Computer Science 2012 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-32589-2_18

zbMATH Keywords

graph drawingbounding polygonspecified point set

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph representations (geometric and intersection representations, etc.) (05C62)

Recommendations

• Embedding planar graphs at fixed vertex locations
• Constrained Point-Set Embeddability of Planar Graphs
• Constrained point-set embeddability of planar graphs
• Drawing graphs in the plane with a prescribed outer face and polynomial area
• Drawing graphs in the plane with a prescribed outer face and polynomial area

Cited in

(5)

• The complexity of drawing a graph in a polygonal region
• Pointed drawings of planar graphs
• One-bend drawings of outerplanar graphs inside simple polygons
• The complexity of drawing a graph in a polygonal region
• Drawing graphs in the plane with a prescribed outer face and polynomial area

This page was built for publication: Drawing planar graphs on points inside a polygon

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