✦ LIBER ✦

Dynamical sets of points

✍ Scribed by Thomas Ottmann; Derick Wood

Publisher: Elsevier Science
Year: 1984
Weight: 89 KB
Volume: 25
Category: Article
ISSN: 0734-189X
DOI: 10.1016/0734-189x(84)90112-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Regular triangulations of dynamic sets o

Regular triangulations of dynamic sets of points

✍ Marc Vigo; Núria Pla; Josep Cotrina 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 596 KB

The Delaunay triangulations of a set of points are a class of triangulations which play an important role in a variety of different disciplines of science. Regular triangulations are a generalization of Delaunay triangulations that maintain both their relationship with convex hulls and with Voronoi

On farthest points of sets

✍ B.B Panda; O.P Kapoor 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 465 KB

Graded sets and points: A stratified app

Graded sets and points: A stratified approach to fuzzy sets and points

✍ JosèA. Herencia 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 598 KB

Periodic Points and Non-wandering Points

Periodic Points and Non-wandering Points of Continuous Dynamical Systems

✍ Edoardo Vesentini 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 279 KB

Let f be a continuous map of an interval I/R. The periods of the periodic points of f are described by a theorem of Sarkovskii [6,12], which defines an ordering in the set N\* of all positive integers in such a way that if n # N\* is a period of x # I, every integer following n in Sarkovskii's order

Minimally Distant Sets of Lattice Points

✍ Daniel J. Kleitman; Leornard J. Schulman 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 393 KB

We consider the problem of finding two sets of given cardinalities in certain grid graphs, so as to minimize the cross-distance between them. (This is the maximum Manhattan distance between points, one of the first set and another of the second set.) The question is answered completely for grids tha

On extreme points of convex sets

✍ Lester E. Dubins 📂 Article 📅 1962 🏛 Elsevier Science 🌐 English ⚖ 355 KB

A convex subset K of a vector space E over the field of real numbers is linearly bounded (linearly closed) if every line intersects K in a bounded (closed) subset of the line. A hyperplane is the set of x ~ E that satisfy a linear equationf(x) = c, wherefis a linear functional and c is a real number