A strong hyperbox-respecting coloring of an n-dimensional hyperbox partition is a coloring of the corners of its hyperboxes with 2n colors such that any hyperbox has all the colors...
We describe algorithms for canonically partitioning semi-regular quadrilateral meshes into structured submeshes, using an adaptation of the geometric motorcycle graph of Eppstein ...
David Eppstein, Michael T. Goodrich, Ethan Kim, Ra...
Given a graph G = (V, E) and a positive integer k, the PARTITION INTO CLIQUES (PIC) decision problem consists of deciding whether there exists a partition of V into k disjoint sub...
Abstract. We introduce an approach to both image labeling and unsupervised image partitioning as different instances of the multicut problem, together with an algorithm returning ...
This paper presents a segmentation algorithm for gray-level images and addresses issues related to its performance on noisy images. It formulates an image segmentation problem as a...