Computing the Union of 3-Colored TrianglesReport as inadecuate

Computing the Union of 3-Colored Triangles - Download this document for free, or read online. Document in PDF available to download.

1 PRISME - Geometry, Algorithms and Robotics CRISAM - Inria Sophia Antipolis - Méditerranée 2 Brown University - Department of Computer Science

Abstract : Given is a set \s\ of $n$ points, each colored with one of $k \geq 3$ colours. We say that a triangle defined by three points of \s\ is 3-colored if its vertices have distinct colours. We prove in this paper that the problem of constructing the boundary of the union \ts\ of all such 3-colored triangles can be done in optimal $On \log n$ time.

Author: Jean-Daniel Boissonnat - Olivier Devillers - Franco Preparata -



Related documents