Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
A LINEAR-TIME ALGORITHM FOR TESTING THE INSCRIBABILITY OF TRIVALENT POLYHEDRA - MaRDI portal

A LINEAR-TIME ALGORITHM FOR TESTING THE INSCRIBABILITY OF TRIVALENT POLYHEDRA

From MaRDI portal

Publication:4698350

Jump to:navigation, search

DOI10.1142/S0218195995000039zbMath0818.68079MaRDI QIDQ4698350

Michael B. Dillencourt, Warren D. Smith

Publication date: 17 May 1995

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

zbMATH Keywords

planar graphs delaunay triangulation trivalent polyhedra

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)

Related Items (max. 100)

About \(f\)-vectors of inscribed simplicial polytopes ⋮ Graph-theoretical conditions for inscribability and Delaunay realizability ⋮ Unnamed Item ⋮ Advances in the theory and practice of graph drawing

This page was built for publication: A LINEAR-TIME ALGORITHM FOR TESTING THE INSCRIBABILITY OF TRIVALENT POLYHEDRA

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4698350&oldid=18931113"