Sciweavers

298 search results - page 1 / 60
» Measuring Linearity of Ordered Point Sets
Sort
View
PSIVT
2007
Springer
110views Multimedia» more  PSIVT 2007»
13 years 10 months ago
Measuring Linearity of Ordered Point Sets
It is often practical to measure how linear a certain ordered set of points is. We are interested in linearity measures which are invariant to rotation, scaling, and translation. T...
Milos Stojmenovic, Amiya Nayak
PR
2008
132views more  PR 2008»
13 years 4 months ago
Measuring linearity of planar point sets
Our goal is to design algorithms that give a linearity measure for planar point sets. There is no explicit discussion on linearity in literature, although some existing shape meas...
Milos Stojmenovic, Amiya Nayak, Jovisa D. Zunic
CIARP
2008
Springer
13 years 6 months ago
Measuring the Related Properties of Linearity and Elongation of Point Sets
The concept of elongation is generally well understood. However, there is no clear, precise, mathematical definition of elongation in any dictionary we could find. We propose that ...
Milos Stojmenovic, Amiya Nayak
DCG
2006
80views more  DCG 2006»
13 years 4 months ago
Lattice Points in Large Borel Sets and Successive Minima
Let B be a Borel set in Ed with volume V (B) = . It is shown that almost all lattices L in Ed contain infinitely many pairwise disjoint d-tuples, that is sets of d linearly indepen...
Iskander Aliev, Peter M. Gruber
SIAMCOMP
1998
114views more  SIAMCOMP 1998»
13 years 4 months ago
Maximum k-Chains in Planar Point Sets: Combinatorial Structure and Algorithms
A chain of a set P of n points in the plane is a chain of the dominance order on P. A k-chain is a subset C of P that can be covered by k chains. A k-chain C is a maximum k-chain ...
Stefan Felsner, Lorenz Wernisch