b'Matias Korman'

research

∙ 06/08/2022

Reconfiguration of Non-crossing Spanning Trees

For a set P of n points in the plane in general position, a non-crossing...

0 Oswin Aichholzer, et al. ∙

research

∙ 05/18/2021

Snipperclips: Cutting Tools into Desired Polygons using Themselves

We study Snipperclips, a computer puzzle game whose objective is to crea...

0 Zachary Abel, et al. ∙

research

∙ 04/07/2021

Robot Development and Path Planning for Indoor Ultraviolet Light Disinfection

Regular irradiation of indoor environments with ultraviolet C (UVC) ligh...

0 Jonathan Conroy, et al. ∙

research

∙ 03/11/2021

Hardness of Token Swapping on Trees

Given a graph where every vertex has exactly one labeled token, how can ...

0 Oswin Aichholzer, et al. ∙

research

∙ 12/21/2020

Efficient Segment Folding is Hard

We introduce a computational origami problem which we call the segment f...

0 Takashi Horiyama, et al. ∙

research

∙ 12/14/2020

Characterizing Universal Reconfigurability of Modular Pivoting Robots

We give both efficient algorithms and hardness results for reconfiguring...

0 Hugo A. Akitaya, et al. ∙

research

∙ 11/14/2020

Reconfiguration of Connected Graph Partitions via Recombination

Motivated by applications in gerrymandering detection, we study a reconf...

0 Hugo A. Akitaya, et al. ∙

research

∙ 07/31/2020

New Results in Sona Drawing: Hardness and TSP Separation

Given a set of point sites, a sona drawing is a single closed curve, dis...

0 Man-Kwun Chiu, et al. ∙

research

∙ 06/24/2020

Distance bounds for high dimensional consistent digital rays and 2-D partially-consistent digital rays

We consider the problem of digitalizing Euclidean segments. Specifically...

0 Man-Kwun Chiu, et al. ∙

research

∙ 06/01/2020

Negative Instance for the Edge Patrolling Beacon Problem

Can an infinite-strength magnetic beacon always “catch” an iron ball, wh...

0 Zachary Abel, et al. ∙

research

∙ 02/14/2020

Kinetic Geodesic Voronoi Diagrams in a Simple Polygon

We study the geodesic Voronoi diagram of a set S of n linearly moving si...

0 Matias Korman, et al. ∙

research

∙ 08/21/2019

Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers

We present the first universal reconfiguration algorithm for transformin...

0 Hugo A. Akitaya, et al. ∙

research

∙ 08/18/2019

Graphs with large total angular resolution

The total angular resolution of a straight-line drawing is the minimum a...

0 Oswin Aichholzer, et al. ∙

research

∙ 03/17/2019

Circumscribing Polygons and Polygonizations for Disjoint Line Segments

Given a planar straight-line graph G=(V,E) in R^2, a circumscribing poly...

0 Hugo A. Akitaya, et al. ∙

research

∙ 02/27/2019

Reconfiguration of Connected Graph Partitions

Motivated by recent computational models for redistricting and detection...

0 Hugo A. Akitaya, et al. ∙

research

∙ 02/18/2019

Routing in Histograms

Let P be an x-monotone orthogonal polygon with n vertices. We call P a s...

0 Man-Kwun Chiu, et al. ∙

research

∙ 06/15/2018

Geometric Algorithms with Limited Workspace: A Survey

In the limited workspace model, we consider algorithms whose input resid...

0 Bahareh Banyassady, et al. ∙

research

∙ 03/08/2018

Routing on the Visibility Graph

We consider the problem of routing on a network in the presence of line ...

0 Prosenjit Bose, et al. ∙

research

∙ 12/15/2017

Rectilinear Link Diameter and Radius in a Rectilinear Polygonal Domain

We study the computation of the diameter and radius under the rectilinea...

0 Man-Kwun Chiu, et al. ∙

research

∙ 10/23/2017

Constrained Routing Between Non-Visible Vertices

In this paper we study local routing strategies on geometric graphs. Suc...

0 Prosenjit Bose, et al. ∙

research

∙ 09/08/2017

Balanced Line Separators of Unit Disk Graphs

We prove a geometric version of the graph separator theorem for the unit...

0 Paz Carmi, et al. ∙

research

∙ 08/25/2017

Gap-planar Graphs

We introduce the family of k-gap-planar graphs for k ≥ 0, i.e., graphs t...

0 Sang Won Bae, et al. ∙

research

∙ 08/21/2017

Geodesic Order Types

The geodesic between two points a and b in the interior of a simple poly...

0 Oswin Aichholzer, et al. ∙

research

∙ 08/21/2017

Helly Numbers of Polyominoes

We define the Helly number of a polyomino P as the smallest number h suc...

0 Jean Cardinal, et al. ∙

research

∙ 08/21/2017

Balanced partitions of 3-colored geometric sets in the plane

Let S be a finite set of geometric objects partitioned into classes or c...

0 Sergey Bereg, et al. ∙

research

∙ 08/02/2017

Improved Time-Space Trade-offs for Computing Voronoi Diagrams

Let P be a planar set of n sites in general position. For k∈{1,...,n-1},...

0 Bahareh Banyassady, et al. ∙

research

∙ 08/02/2017

Line Segment Covering of Cells in Arrangements

Given a collection L of line segments, we consider its arrangement and s...

0 Matias Korman, et al. ∙

research

∙ 07/18/2017

Packing Plane Spanning Trees and Paths in Complete Geometric Graphs

We consider the following question: How many edge-disjoint plane spannin...

0 Oswin Aichholzer, et al. ∙

research

∙ 06/15/2017

Experimental Study of Compressed Stack Algorithms in Limited Memory Environments

The compressed stack is a data structure designed by Barba et al. (Alg...

0 Jean-Francois Baffier, et al. ∙

Matias Korman

Featured Co-authors