activity
20192024
most citedThe k-d tree data structure and a proof for neighborhood computation in expected logarithmic time

10 citations · 13 across the 4 of their papers we have counts for

collaborators

5 papers

cs.GR20241 cited

Holonomy: A Virtual Reality Exploration of Hyperbolic Geometry

Martin Skrodzki, Scott Jochems, Joris Rijsdijk +2

HOLONOMY is a virtual environment based on the mathematical concept of hyperbolic geometry. Unlike other environments, HOLONOMY allows users to seamlessly explore an infinite hyper…

cs.GR20221 cited

Weaving patterns inspired by the pentagon snub subdivision scheme

Henriette Lipschütz, Ulrich Reitebuch, Martin Skrodzki +1

Various computer simulations regarding, e.g., the weather or structural mechanics, solve complex problems on a two-dimensional domain. They mostly do so by splitting the input doma…

cs.GR2020

Variational Shape Approximation of Point Set Surfaces

Martin Skrodzki, Eric Zimmermann, Konrad Polthier

In this work, we present a translation of the complete pipeline for variational shape approximation (VSA) to the setting of point sets. First, we describe an explicit example for t…

cs.SE20201 cited

How the deprecation of Java applets affected online visualization frameworks -- a case study

Martin Skrodzki

The JavaView visualization framework was designed at the end of the 1990s as a software that provides - among other services - easy, interactive geometry visualizations on web page…

cs.DS201910 cited

The k-d tree data structure and a proof for neighborhood computation in expected logarithmic time

Martin Skrodzki

For practical applications, any neighborhood concept imposed on a finite point set P is not of any use if it cannot be computed efficiently. Thus, in this paper, we give an introdu…