Kinetic and Stationary Point-Set Embeddability for Plane Graphs

DOI10.1007/978-3-642-36763-2_25zbMath1377.68186OpenAlexW1519709295MaRDI QIDQ4912210

Valerie King, Zahed Rahmati, S. H. 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

plane graphpoint-set embeddabilitykinetic algorithmkinetic graph drawing

Mathematics Subject Classification ID

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

Related Items (1)

A simple, faster method for kinetic proximity problems

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