A LINEAR-TIME ALGORITHM FOR TESTING THE INSCRIBABILITY OF TRIVALENT POLYHEDRA
1995 ◽
Vol 05
(01n02)
◽
pp. 21-36
◽
Keyword(s):
We present an algorithm for testing the inscribability of a trivalent polyhedron or, equivalently, testing the circumscribability of a simplicial polyhedron. Our algorithm, which runs in linear time and uses only low-precision integer arithmetic, is based on a purely combinatorial characterization of inscribable trivalent polyhedra.
2000 ◽
Vol 11
(03)
◽
pp. 365-371
◽
Keyword(s):
2012 ◽
Vol 160
(3)
◽
pp. 210-217
◽
Keyword(s):