✦ LIBER ✦

Vietoris–Rips Complexes of Planar Point Sets

✍ Scribed by Erin W. Chambers; Vin de Silva; Jeff Erickson; Robert Ghrist

Publisher: Springer
Year: 2009
Tongue: English
Weight: 506 KB
Volume: 44
Category: Article
ISSN: 0179-5376
DOI: 10.1007/s00454-009-9209-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Extremal Betti Numbers of Vietoris–Rips

Extremal Betti Numbers of Vietoris–Rips Complexes

✍ Michael Goff 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 800 KB

Vietoris-Rips complexes of metric spaces

Vietoris-Rips complexes of metric spaces near a closed Riemannian manifold

✍ J. Latschev 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 94 KB

Distance Sets of Well-Distributed Planar

Distance Sets of Well-Distributed Planar Point Sets

✍ A. Iosevich; I. Laba 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 191 KB

Ambiguous Points of Arbitrary Planar Set

Ambiguous Points of Arbitrary Planar Sets and Functions

✍ Frederick Bagemihl 📂 Article 📅 1966 🏛 John Wiley and Sons 🌐 English ⚖ 720 KB

Computing the shape of a planar points s

Computing the shape of a planar points set

✍ Mahmoud Melkemi; Mourad Djebali 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 701 KB

In this article, we introduce a mathematical formalism de"ning the shape of a "nite point set which we call A-shape. The parameter A is a "nite set of points which positions variation allows A-shape to generate a family of graphs extracted from Delaunay triangulation. Each graph corresponds to an el

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)