On a triangle counting problem
Information Processing Letters
Discrete Mathematics - Topological, algebraical and combinatorial structures; Froli´k's memorial volume
A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
Discrete & Computational Geometry - Special issue on ACM symposium on computational geometry, North Conway
Colourful linear programming and its relatives
Mathematics of Operations Research
Handbook of discrete and computational geometry
The vertex set of a 0/1-polytope is strongly P-enumerable
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
Consider a set P of n points in the plane, where each point is associated with one of three colours. We give an output-sensitive algorithm that enumerates a set of triangles T, where each triangle in T contains the origin and its three vertices are points in P with distinct colours. Our algorithm requires O(n+|T|) time, and hence it is asymptotically optimal in terms of n and |T|.