13 research outputs found
Convex Equipartitions via Equivariant Obstruction Theory
We describe a regular cell complex model for the configuration space
F(\R^d,n). Based on this, we use Equivariant Obstruction Theory to prove the
prime power case of the conjecture by Nandakumar and Ramana Rao that every
polygon can be partitioned into n convex parts of equal area and perimeter.Comment: Revised and improved version with extra explanations, 20 pages, 7
figures, to appear in Israel J. Mat
A numerical algorithm for semi-discrete optimal transport in 3D
This paper introduces a numerical algorithm to compute the optimal
transport map between two measures and , where derives from a
density defined as a piecewise linear function (supported by a
tetrahedral mesh), and where is a sum of Dirac masses.
I first give an elementary presentation of some known results on optimal
transport and then observe a relation with another problem (optimal sampling).
This relation gives simple arguments to study the objective functions that
characterize both problems.
I then propose a practical algorithm to compute the optimal transport map
between a piecewise linear density and a sum of Dirac masses in 3D. In this
semi-discrete setting, Aurenhammer et.al [\emph{8th Symposium on Computational
Geometry conf. proc.}, ACM (1992)] showed that the optimal transport map is
determined by the weights of a power diagram. The optimal weights are computed
by minimizing a convex objective function with a quasi-Newton method. To
evaluate the value and gradient of this objective function, I propose an
efficient and robust algorithm, that computes at each iteration the
intersection between a power diagram and the tetrahedral mesh that defines the
measure .
The numerical algorithm is experimented and evaluated on several datasets,
with up to hundred thousands tetrahedra and one million Dirac masses.Comment: 23 pages, 14 figure
Notions of optimal transport theory and how to implement them on a computer
This article gives an introduction to optimal transport, a mathematical
theory that makes it possible to measure distances between functions (or
distances between more general objects), to interpolate between objects or to
enforce mass/volume conservation in certain computational physics simulations.
Optimal transport is a rich scientific domain, with active research
communities, both on its theoretical aspects and on more applicative
considerations, such as geometry processing and machine learning. This article
aims at explaining the main principles behind the theory of optimal transport,
introduce the different involved notions, and more importantly, how they
relate, to let the reader grasp an intuition of the elegant theory that
structures them. Then we will consider a specific setting, called
semi-discrete, where a continuous function is transported to a discrete sum of
Dirac masses. Studying this specific setting naturally leads to an efficient
computational algorithm, that uses classical notions of computational geometry,
such as a generalization of Voronoi diagrams called Laguerre diagrams.Comment: 32 pages, 17 figure
Stochastic Wasserstein Barycenters
We present a stochastic algorithm to compute the barycenter of a set of
probability distributions under the Wasserstein metric from optimal transport.
Unlike previous approaches, our method extends to continuous input
distributions and allows the support of the barycenter to be adjusted in each
iteration. We tackle the problem without regularization, allowing us to recover
a sharp output whose support is contained within the support of the true
barycenter. We give examples where our algorithm recovers a more meaningful
barycenter than previous work. Our method is versatile and can be extended to
applications such as generating super samples from a given distribution and
recovering blue noise approximations.Comment: ICML 201
Tree-based Partition Querying: A Methodology for Computing Medoids in Large Spatial Datasets
Besides traditional domains (e.g., resource allocation, data mining applications), algorithms for medoid computation and related problems will play an important role in numerous emerging fields, such as location based services and sensor networks. Since the k-medoid problem is NP-hard, all existing work deals with approximate solutions on relatively small datasets. This paper aims at efficient methods for very large spatial databases, motivated by: (1) the high and ever increasing availability of spatial data, and (2) the need for novel query types and improved services. The proposed solutions exploit the intrinsic grouping properties of a data partition index in order to read only a small part of the dataset. Compared to previous approaches, we achieve results of comparable or better quality at a small fraction of the CPU and I/O costs (seconds as opposed to hours, and tens of node accesses instead of thousands). In addition, we study medoid-aggregate queries, where k is not known in advance, but we are asked to compute a medoid set that leads to an average distance close to a user-specified value. Similarly, medoid-optimization queries aim at minimizing both the number of medoids k and the average distance. We also consider the max version for the aforementioned problems, where the goal is to minimize the maximum (instead of the average) distance between any object and its closest medoid. Finally, we investigate bichromatic and weighted medoid versions for all query types, as well as, maximum capacity and dynamic medoids