Enumerating trichromatic triangles containing the origin in linear time

DOI10.1016/j.jda.2012.11.001zbMath1272.68412OpenAlexW2043238562MaRDI QIDQ2376788

Amr Elmasry

Publication date: 24 June 2013

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2012.11.001

zbMATH Keywords

output-sensitive algorithmsenumeration algorithmsCaratheodory's theoremcoloured simplices

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Combinatorial complexity of geometric structures (52C45)

Uses Software

• AS 307

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a triangle counting problem
• A generalization of Caratheodory's theorem
• A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
• Geometric medians
• The vertex set of a \(0/1\)-polytope is strongly \(\mathcal P\)-enumerable
• Finding the convex hull facet by facet
• Colourful Linear Programming and its Relatives
• Algorithm AS 307: Bivariate Location Depth
• FINDING SIMPLICES CONTAINING THE ORIGIN IN TWO AND THREE DIMENSIONS

This page was built for publication: Enumerating trichromatic triangles containing the origin in linear time