
Extraction of cylinders and cones from minimal point sets
We propose new algebraic methods for extracting cylinders and cones from...
read it

Deciding whether a Lattice has an Orthonormal Basis is in coNP
We show that the problem of deciding whether a given Euclidean lattice L...
read it

The Graph Limit of The Minimizer of The OnsagerMachlup Functional and Its Computation
The OnsagerMachlup (OM) functional is wellknown for characterizing the...
read it

Limiting behaviour of the generalized simplex gradient as the number of points tends to infinity on a fixed shape in R^n
This work investigates the asymptotic behaviour of the gradient approxim...
read it

Digital Convex + Unimodular Mapping =8Connected (All Points but One 4Connected)
In two dimensional digital geometry, two lattice points are 4connected ...
read it

A note on the dispersion of admissible lattices
In this note we show that the volume of axisparallel boxes in R^d which...
read it

Note on minimal number of skewed unit cells for periodic distance calculation
How many copies of a parallelepiped are needed to ensure that for every ...
read it
Lonely Points in Simplices
Given a lattice L in Z^m and a subset A of R^m, we say that a point in A is lonely if it is not equivalent modulo L to another point of A. We are interested in identifying lonely points for specific choices of L when A is a dilated standard simplex, and in conditions on L which ensure that the number of lonely points is unbounded as the simplex dilation goes to infinity.
READ FULL TEXT
Comments
There are no comments yet.