
Computing Convex Partitions for Point Sets in the Plane: The CG:SHOP Challenge 2020
We give an overview of the 2020 Computational Geometry Challenge, which ...
read it

Probing a Set of Trajectories to Maximize Captured Information
We study a trajectory analysis problem we call the Trajectory Capture Pr...
read it

Minimum Scan Cover with Angular Transition Costs
We provide a comprehensive study of a natural geometric optimization pro...
read it

WorstCase Optimal Covering of Rectangles by Disks
We provide the solution for a fundamental problem of geometric optimizat...
read it

Folding Polyominoes with Holes into a Cube
When can a polyomino piece of paper be folded into a unit cube? Prior wo...
read it

Parallel Online Algorithms for the Bin Packing Problem
We study parallel online algorithms: For some fixed integer k, a colle...
read it

Connected Assembly and Reconfiguration by Finite Automata
We consider methods for connected reconfigurations by finite automate in...
read it

Online Circle Packing
We consider the online problem of packing circles into a square containe...
read it

Packing Disks into Disks with Optimal WorstCase Density
We provide a tight result for a fundamental problem arising from packing...
read it

CADbots: Algorithmic Aspects of Manipulating Programmable Matter with Finite Automata
We contribute results for a set of fundamental problems in the context o...
read it

Covering Tours and Cycle Covers with Turn Costs: Hardness and Approximation
We investigate a variety of problems of finding tours and cycle covers w...
read it

Efficient Parallel SelfAssembly Under Uniform Control Inputs
We prove that by successively combining subassemblies, we can achieve su...
read it

Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch
We present a number of breakthroughs for coordinated motion planning, in...
read it

Folding Polyominoes into (Poly)Cubes
We study the problem of folding a polyomino P into a polycube Q, allowin...
read it

Don't Rock the Boat: Algorithms for Balanced Dynamic Loading and Unloading
We consider dynamic loading and unloading problems for heavy geometric o...
read it

Particle Computation: Complexity, Algorithms, and Logic
We investigate algorithmic control of a large swarm of mobile particles ...
read it

Tilt Assembly: Algorithms for MicroFactories That Build Objects with Uniform External Forces
We present algorithmic results for the parallel assembly of many micros...
read it

ConflictFree Coloring of Intersection Graphs
A conflictfree kcoloring of a graph G=(V,E) assigns one of k different...
read it

A Protocol for SelfSynchronized DutyCycling in Sensor Networks: Generic Implementation in Wiselib
In this work we present a protocol for selfsynchronized dutycycling in...
read it

The Geometric Maximum Traveling Salesman Problem
We consider the traveling salesman problem when the cities are points in...
read it
Sandor P. Fekete
is this you? claim profile