𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Stabbing parallel segments with a convex polygon

✍ Scribed by Michael T. Goodrich; Jack Scott Snoeyink

Publisher
Elsevier Science
Year
1989
Weight
74 KB
Volume
48
Category
Article
ISSN
0734-189X

No coin nor oath required. For personal study only.

✦ Synopsis

We develop a technique using general moments to find the orientations of 2D planar orthographic projections of 3D objects, even if the 3D object has a completely unknown structure. The technique should open new classes of biological materials for ultrastructural analysis, through molecular scale transmission electron microscopy reconstruction applications where the original 3D object's structure is unknown. In machine vision applications where the full 3D structure is known, the technique provides a fast and computationally efficient way to orient projections. The techm'que can also be used to orient 1D line projections of 2D unknown objects.

πŸ“œ SIMILAR VOLUMES

A nearly optimal parallel algorithm for
A nearly optimal parallel algorithm for the Voronoi diagram of a convex polygon
✍ Piotr Berman; Andrzej Lingas πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 756 KB

We present a parallel algorithm for the Voronoi diagram of the set of vertices of a convex polygon. The algorithm runs in time O(logn) and uses O(n loglogn/log n) processors in the CRCW PRAM model. The concurrent write is used only by an integer sorting subroutine. We also obtain an O(log n)-time an