𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Maintaining the Extent of a Moving Point Set

✍ Scribed by P. K. Agarwal; L. J. Guibas; J. Hershberger; E. Veach

Publisher
Springer
Year
2001
Tongue
English
Weight
236 KB
Volume
26
Category
Article
ISSN
0179-5376

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Building and maintaining ontologies: a s
Building and maintaining ontologies: a set of algorithms
✍ Nadira Lammari; Elisabeth MΓ©tais πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 396 KB

Is\_A'' links are the core component of all ontologies and are organized into ''hierarchies of concepts''. In this paper we will first address the problem of an automatic help to build sound hierarchies. Dependencies called ''existence constraints'' are the foundation for the definition of a ''norma

The set of neighbours of a set in a poin
The set of neighbours of a set in a point-lattice
✍ B. Uhrin πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 454 KB

## Given an n-dimensional point-lattice A c [w" and a bounded set A c KY, the set S(A) of nonzero lattice points ueA such that A n (A + u) # f~ is called the set of neighbours of A in ,4. In the paper a disjoint decomposition of S(A) is showed which gives a representation of the cardinality N(A) o

The santalo point of a planar convex set
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)