Computing the union of 3-colored triangles
- 96 Downloads
Given is a set S of n points, each colored with one of k≥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 T(S) of all such 3-colored triangles can be done in optimal O(n log n) time.
KeywordsConvex hull Legged robot Motion planning Stability
Unable to display preview. Download preview PDF.
- J.D. Boissonnat and O. Devillers. Motion Planning of Legged Robots. Technical Report, Institut National de Recherche en Informatique et Automatique, (France), 1991. In preparation.Google Scholar
- F.P. Preparata and M.I. Shamos. Computational Geometry: an Introduction. Springer-Verlag, 1985.Google Scholar