Overlaying simply connected planar subdivisions in linear time
Proceedings of the eleventh annual symposium on Computational geometry
LEDA: a platform for combinatorial and geometric computing
LEDA: a platform for combinatorial and geometric computing
An Efficient Algorithm to Calculate the Minkowski Sum of Convex 3D Polyhedra
ICCS '01 Proceedings of the International Conference on Computational Sciences-Part I
| Hi-index | 0.00 |
A method is introduced to map a graph on the sphere to the finite plane. The method works by first mapping the graph on the sphere to a tetrahedron. Then the graph on the tetrahedron is mapped to the plane. Using this mapping, arc intersection on the sphere, overlaying subdivisions on the sphere and point location on the sphere may be done by using algorithms in the plane.