activity
20122023
most citedNew variants of Perfect Non-crossing Matchings

2 citations · 3 across the 4 of their papers we have counts for

collaborators

6 papers

cs.CG2023

The Voronoi Diagram of Rotating Rays with applications to Floodlight Illumination

Carlos Alegría, Ioannis Mantas, Evanthia Papadopoulou +3

We study the Voronoi Diagram of Rotating Rays, a Voronoi structure where the input sites are rays and the distance function between a point and a site/ray, is the counterclockwise…

cs.CG2020★ 2 cited

New variants of Perfect Non-crossing Matchings

Ioannis Mantas, Marko Savić, Hendrik Schrezenmaier

Given a set of points in the plane, we are interested in matching them with straight line segments. We focus on perfect (all points are matched) non-crossing (no two edges intersec…

cs.CG2018

Structural Properties of Bichromatic Non-crossing Matchings

Marko Savić, Miloš Stojaković

Given a set of red and blue points in the plane, we are interested in matching red points with blue points by straight line segments so that the segments do not cross. We d…

cs.CG2016

Faster Bottleneck Non-crossing Matchings of Points in Convex Position

Marko Savić, Miloš Stojaković

Given an even number of points in a plane, we are interested in matching all the points by straight line segments so that the segments do not cross. Bottleneck matching is a matchi…

math.DS2015

Digit sequences of rational billiards on tables which tile

Corey Manack, Marko Savic

We classify the periodic digit strings which arise from periodic billiard orbits on the four convex -gons which tile under reflection, answering problem a pos…

cs.CG2012★ 1 cited

Linear Time Algorithm for Optimal Feed-link Placement

Marko Savić, Miloš Stojaković

Given a polygon representing a transportation network together with a point p in its interior, we aim to extend the network by inserting a line segment, called a feed-link, which c…