CCCG
2008
13 years 6 months ago
2008
We give a very short proof of the following result of Graham from 1980: For any finite coloring of Rd , d 2, and for any > 0, there is a monochromatic (d + 1)-tuple that span...
CCCG
2008
13 years 6 months ago
2008
Given a set of points in a Hilbert space that can be separated from the origin. The slab support vector machine (slab SVM) is an optimization problem that aims at finding a slab (...
CCCG
2008
13 years 6 months ago
2008
CCCG
2008
13 years 6 months ago
2008
Curve matching is an important computational task for domains such as: reconstruction of archaeological fragments, forensics investigation, measuring melodic similarity, and model...
CCCG
2008
13 years 6 months ago
2008
Simple curves on surfaces are often represented as sequences of intersections with a triangulation. However, there are much more succinct ways of representing simple curves used i...
CCCG
2008
13 years 6 months ago
2008
We define a class of algorithms for constructing coresets of (geometric) data sets, and show that algorithms in this class can be dynamized efficiently in the insertiononly (data ...
CCCG
2008
13 years 6 months ago
2008
Given a collection of points representing geographic data we consider the task of delineating boundaries based on the features of the points. Assuming that the features are binary...
CCCG
2008
13 years 6 months ago
2008
CCCG
2008
13 years 6 months ago
2008
We prove a tight asymptotic bound of ( log(n/)) on the worst case computational complexity of the convex hull of the union of two convex objects of sizes summing to n requiring o...
CCCG
2008
13 years 6 months ago
2008
Homometric rhythms/chords (henceforth: rhythms) are those with the same histogram or multiset of intervals/distances. The purpose of this note is threefold. First to point out the...