Computational geometry: an introduction
Computational geometry: an introduction
Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
Toughness and Delaunay triangulations
Discrete & Computational Geometry
The realization problem for Euclidean minimum spanning trees is NP-hard
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Convex drawings of graphs in two and three dimensions (preliminary version)
Proceedings of the twelfth annual symposium on Computational geometry
Subgraph isomorphism in planar graphs and related problems
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
| Hi-index | 0.00 |
We present an algorithm for testing the inscribability of a trivalent polyhedron, or, equivalently, testing the circumscribability of a simplicial polyhedron. Our algorithm runs in linear time, using only low-precision integer arithmetic. The algorithm is based on a purely combinatorial characterization of inscribable trivalent polyhedra.