W. Mulzer

activity

20062025

most citedMinimum-weight triangulation is NP-hard

182 citations · 515 across the 59 of their papers we have counts for

collaborators

Showing 2014 · cs.CGShow all

3 papers · 2 filters

cs.CG2014★ 3 cited

Computational Aspects of the Colorful Carathéodory Theorem

Wolfgang Mulzer, Yannik Stein

Let $C_{1}, \dots, C_{d + 1} \subset R^{d}$ be $d + 1$ point sets, each containing the origin in its convex hull. We call these sets color classes, and we call a sequence $p_1, \dots…

cs.CG2014

Approximate k-flat Nearest Neighbor Search

Wolfgang Mulzer, Huy L. Nguyen, Paul Seiferth +1

Let $k$ be a nonnegative integer. In the approximate $k$ -flat nearest neighbor ( $k$ -ANN) problem, we are given a set $P \subset R^{d}$ of $n$ points in $d$ -dimensional space…

cs.CG2014★ 2 cited

Interference Minimization in Asymmetric Sensor Networks

Yves Brise, Kevin Buchin, Dustin Eversmann +2

A fundamental problem in wireless sensor networks is to connect a given set of sensors while minimizing the \emph{receiver interference}. This is modeled as follows: each sensor no…