3 papers
cs.CG2012
A Generalization of the Convex Kakeya Problem
Hee-Kap Ahn, Sang Won Bae, Otfried Cheong +3
Given a set of line segments in the plane, not necessarily finite, what is a convex region of smallest area that contains a translate of each input segment? This question can be se…
cs.CG2009
On the Expected Maximum Degree of Gabriel and Yao Graphs
Luc Devroye, Joachim Gudmundsson, Pat Morin
Motivated by applications of Gabriel graphs and Yao graphs in wireless ad-hoc networks, we show that the maximal degree of a random Gabriel graph or Yao graph defined on points…
cs.CG2009
Algorithms for Marketing-Mix Optimization
Joachim Gudmundsson, Pat Morin, Michiel Smid
Algorithms for determining quality/cost/price tradeoffs in saturated markets are considered. A product is modeled by real-valued qualities whose sum determines the unit cost of…