Nelly Villamizar

h-index8
2papers
222citations

2 Papers

2.4COJun 15
Trivariate Splines on Fans of Hyperplane Arrangements and Koszul Homology

Carles Checa, Michael DiPasquale, Pablo Mazón et al.

We study the space of splines $\mathcal{S}^{\mathbf{r}}(Σ^\mathscr{A})$ where ${\mathbf{r}}$ denotes a smoothness distribution and $Σ^\mathscr{A}$ is the fan of a central hyperplane arrangement $\mathscr{A}$ in $\mathbb{R}^3$. This is the first step in the analysis of splines on three-dimensional cross-cut partitions, which naturally generalize planar cross-cut partitions. We show that the Hilbert function of $\mathcal{S}^{\mathbf{r}}(Σ^\mathscr{A})$ is bounded by an expression that involves the dimensions of specific Koszul homology modules constructed from the defining equations of the hyperplane arrangement $\mathscr{A}$ and the smoothness distribution function. By exploiting this connection with Koszul homology, we are able to: 1) compute the dimension of the spline space in high degrees, 2) compute all values of the dimension of the spline space if $\mathscr{A}$ is generic with five or fewer hyperplanes, and 3) compute the Hilbert function of the spline space if $\mathscr{A}$ is a generic arrangement with sufficiently many hyperplanes and ${\mathbf{r}}$ is a constant distribution. As an application of our methods, we compute $\dim \mathcal{S}^0_d(Σ^\mathscr{A})$ and $\dim \mathcal{S}^1_d(Σ^\mathscr{A})$ for all values of $d$ when $\mathscr{A}$ is a generic arrangement.

7.3SCFeb 19, 2015
Planar Linkages Following a Prescribed Motion

Matteo Gallet, Christoph Koutschan, Zijia Li et al.

Designing mechanical devices, called linkages, that draw a given plane curve has been a topic that interested engineers and mathematicians for hundreds of years, and recently also computer scientists. Already in 1876, Kempe proposed a procedure for solving the problem in full generality, but his constructions tend to be extremely complicated. We provide a novel algorithm that produces much simpler linkages, but works only for parametric curves. Our approach is to transform the problem into a factorization task over some noncommutative algebra. We show how to compute such a factorization, and how to use it to construct a linkage tracing a given curve.