Kinetic and Stationary Point-Set Embeddability for Plane Graphs

DOI10.1007/978-3-642-36763-2_25MaRDI QIDQ4912210zbMATH OpenOpenAlexFDO

Authors Zahed Rahmati, Valerie King, Sue Whitesides

Publication date 3 April 2013

Published in Graph Drawing (Search for Journal in Brave)

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

zbMATH Keywords

kinetic algorithmkinetic graph drawingplane graphpoint-set embeddability

Mathematics Subject Classification ID

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

Recommendations

• The point-set embeddability problem for plane graphs
• The point-set embeddability problem for plane graphs
• Constrained Point-Set Embeddability of Planar Graphs
• Constrained point-set embeddability of planar graphs
• Bounded Embeddings of Graphs in the Plane
• On point set embeddings for k-planar graphs with few bends per edge
• Algorithms and Computation
• EMBEDDING POINT SETS INTO PLANE GRAPHS OF SMALL DILATION
• On embedding an outer-planar graph in a point set
• Graphs embedded in the plane with a bounded number of accumulation points

Cited in

(2)

• A simple, faster method for kinetic proximity problems
• Graph Drawing

This page was built for publication: Kinetic and Stationary Point-Set Embeddability for Plane Graphs

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