8 citations · 14 across the 6 of their papers we have counts for
8 papers
Visibility Queries in Simple Polygons
Sujoy Bhore, Chih-Hung Liu, Anurag Murty Naredla +6
Given a simple polygon with vertices, we consider the problem of constructing a data structure for visibility queries: for any query point , compute the visibility…
Local Routing in a Tree Metric 1-Spanner
Milutin Brankovic, Joachim Gudmundsson, André van Renssen
Solomon and Elkin constructed a shortcutting scheme for weighted trees which results in a 1-spanner for the tree metric induced by the input tree. The spanner has logarithmic light…
Bounded-Degree Spanners in the Presence of Polygonal Obstacles
André van Renssen, Gladys Wong
Let be a finite set of vertices in the plane and be a finite set of polygonal obstacles, where the vertices of are in . We show how to construct a plane -spanner…
A Simple Dynamization of Trapezoidal Point Location in Planar Subdivisions
Milutin Brankovic, Nikola Grujic, André van Renssen +1
We study how to dynamize the Trapezoidal Search Tree - a well known randomized point location structure for planar subdivisions of kinetic line segments. Our approach naturally ext…
Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The Musketeers
Hugo A. Akitaya, Esther M. Arkin, Mirela Damian +8
We present the first universal reconfiguration algorithm for transforming a modular robot between any two facet-connected square-grid configurations using pivot moves. More precise…
Geometry and Generation of a New Graph Planarity Game
Rutger Kraaijer, Marc van Kreveld, Wouter Meulemans +1
We introduce a new abstract graph game, Swap Planarity, where the goal is to reach a state without edge intersections and a move consists of swapping the locations of two vertices…