Answers are grounded in this paper and cite their sources.
Examples of fruitful interaction between geometrical combinatorics and the design and analysis of algorithms are presented. A demonstration is given of the way in which a simple geometrical construction yields new and efficient algorithms for various searching and list manipulation problems.
No takes yet. Share an insight, caveat, or question.
Jean Vuillemin (1980) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: