12 citations · 24 across the 10 of their papers we have counts for
10 papers
Universal convex covering problems under translation and discrete rotations
Mook Kwon Jung, Sang Duk Yoon, Hee-Kap Ahn +1
We consider the smallest-area universal covering of planar objects of perimeter 2 (or equivalently closed curves of length 2) allowing translation and discrete rotations. In partic…
Distance bounds for high dimensional consistent digital rays and 2-D partially-consistent digital rays
Man-Kwun Chiu, Matias Korman, Martin Suderland +1
We consider the problem of digitalizing Euclidean segments. Specifically, we look for a constructive method to connect any two points in . The construction must be {\…
Colored Spanning Graphs for Set Visualization
Ferran Hurtado, Matias Korman, Marc van Kreveld +6
We study an algorithmic problem that is motivated by ink minimization for sparse set visualizations. Our input is a set of points in the plane which are either blue, red, or purple…
Efficiently Correcting Matrix Products
Leszek Gasieniec, Christos Levcopoulos, Andrzej Lingas +2
We study the problem of efficiently correcting an erroneous product of two matrices over a ring. Among other things, we provide a randomized algorithm for correcting a…
Weight Balancing on Boundaries
Luis Barba, Otfried Cheong, Michael Gene Dobbins +8
Given a polygonal region containing a target point (which we assume is the origin), it is not hard to see that there are two points on the perimeter that are antipodal, that is, wh…
Order Preserving Matching
Jinil Kim, Peter Eades, Rudolf Fleischer +5
We introduce a new string matching problem called order-preserving matching on numeric strings where a pattern matches a text if the text contains a substring whose relative orders…