✦ LIBER ✦

Optimal algorithms for finding the symmetries of a planar point set

✍ Scribed by P.T. Highnam

Book ID: 113162922
Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 288 KB
Volume: 22
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(86)90097-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A new algorithm for computing the convex

A new algorithm for computing the convex hull of a planar point set

✍ Guang-hui Liu; Chuan-bo Chen 📂 Article 📅 2007 🏛 SP Zhejiang University Press 🌐 English ⚖ 284 KB

An algorithm for finding a large indepen

An algorithm for finding a large independent set in planar graphs

✍ Norishige Chiba; Takao Nishizeki; Nobuji Saito 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 333 KB 👁 1 views

Algorithms for finding an optimal set of

Algorithms for finding an optimal set of short disjoint paths in a communication network

✍ Torrieri, D. 📂 Article 📅 1992 🏛 IEEE 🌐 English ⚖ 461 KB

An optimal parallel algorithm for buildi

An optimal parallel algorithm for building a data structure for planar point location

✍ Richard Cole; Ofer Zajlcek 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 658 KB

An optimal parallel algorithm for triang

An optimal parallel algorithm for triangulating a set of points in the plane

✍ Ed Merks 📂 Article 📅 1986 🏛 Springer 🌐 English ⚖ 510 KB

The santalo point of a planar convex set

✍ M.J. Kaiser 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 505 KB

An algorithm is described to determine the minimum area polar set of a planar convex polygon described in terms of its vertices. We adopt a result due to Santalo to verify our minimizing solution, and then demonstrate the search procedure on a few examples. 'For triangular (and centrally symmetric)