Point set embedding in 3D

DOI10.7155/JGAA.00355MaRDI QIDQ5250131zbMATH OpenOpenAlexFDO

Authors Henk Meijer, S. Wismath

Publication date 18 May 2015

Published in Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.7155/jgaa.00355

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Point-set embeddings of plane 3-trees (extended abstract)
• Point-set embeddings of plane 3-trees
• Improved algorithms for the point-set embeddability problem for plane 3-trees
• Constrained point-set embeddability of planar graphs
• Embedding plane 3-trees in \(\mathbb R^{2}\) and \(\mathbb R^{3}\)

Cited in

(5)

• A concise characterization of 3D simple points
• On embedding triconnected cubic graphs on point sets
• Drawing 3-polytopes with good vertex resolution
• Drawing 3-polytopes with good vertex resolution
• A 3D Ginibre point field

This page was built for publication: Point set embedding in 3D

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