
Snipperclips: Cutting Tools into Desired Polygons using Themselves
We study Snipperclips, a computer puzzle game whose objective is to crea...
read it

Translation Invariant Fréchet Distance Queries
The Fréchet distance is a popular similarity measure between curves. For...
read it

Covering a set of line segments with a few squares
We study three covering problems in the plane. Our original motivation f...
read it

Local Routing in a Tree Metric 1Spanner
Solomon and Elkin constructed a shortcutting scheme for weighted trees w...
read it

BoundedDegree Spanners in the Presence of Polygonal Obstacles
Let V be a finite set of vertices in the plane and S be a finite set of ...
read it

Kinetic Geodesic Voronoi Diagrams in a Simple Polygon
We study the geodesic Voronoi diagram of a set S of n linearly moving si...
read it

A Simple Dynamization of Trapezoidal Point Location in Planar Subdivisions
We study how to dynamize the Trapezoidal Search Tree  a well known rand...
read it

Local Routing in Sparse and Lightweight Geometric Graphs
Online routing in a planar embedded graph is central to a number of fiel...
read it

Universal Reconfiguration of FacetConnected Modular Robots by Pivots: The O(1) Musketeers
We present the first universal reconfiguration algorithm for transformin...
read it

Graphs with large total angular resolution
The total angular resolution of a straightline drawing is the minimum a...
read it

Geometry and Generation of a New Graph Planarity Game
We introduce a new abstract graph game, Swap Planarity, where the goal i...
read it

Routing in Histograms
Let P be an xmonotone orthogonal polygon with n vertices. We call P a s...
read it

Routing on the Visibility Graph
We consider the problem of routing on a network in the presence of line ...
read it

Rectilinear Link Diameter and Radius in a Rectilinear Polygonal Domain
We study the computation of the diameter and radius under the rectilinea...
read it

Constrained Routing Between NonVisible Vertices
In this paper we study local routing strategies on geometric graphs. Suc...
read it

Balanced Line Separators of Unit Disk Graphs
We prove a geometric version of the graph separator theorem for the unit...
read it

Improved TimeSpace Tradeoffs for Computing Voronoi Diagrams
Let P be a planar set of n sites in general position. For k∈{1,...,n1},...
read it
André van Renssen
is this you? claim profile