A triangular grid graph is a finite induced subgraph of the infinite graph associated with the two-dimensional triangular grid. In 2000, Reay and Zamfirescu showed that all 2-conne...
G. Wegner [12] gave a geometric characterization of all so–called Groemer packing of n ≥ 2 unit discs in E2 that are densest packings of n unit discs with respect to the conve...
Nonparametric neighborhood methods for learning entail estimation of class conditional probabilities based on relative frequencies of samples that are "near-neighbors" of...
Consider the moment curve in the real Euclidean space Rd defined parametrically by the map : R Rd , t (t) = (t, t2 , . . . , td ). The cyclic d-polytope Cd(t1, . . . , tn) is t...
An ordered partition of a set of n points in the d dimensional Euclidean space is called a separable partition if the convex hulls of the parts are pairwise disjoint. For each fix...