CCCG
2004
15 years 2 months ago
2004
99
Voted
CCCG
2004
15 years 2 months ago
2004
We establish upper and lower bounds on the number of connected components of lines tangent to four triangles in R3 . We show that four triangles in R3 may admit at least 88 tangent...
82
Voted
CCCG
2004
15 years 2 months ago
2004
Given a set of n points in the plane, we show how to compute various enclosing isosceles triangles where different parameters such as area or perimeter are optimized. We then stud...
72
Voted
CCCG
2004
15 years 2 months ago
2004
CCCG
2004
15 years 2 months ago
2004
64
Voted
CCCG
2004
15 years 2 months ago
2004
71
Voted
CCCG
2004
15 years 2 months ago
2004
109
Voted
CCCG
2007
15 years 2 months ago
2007
In the minimum-cost k-hop spanning tree (k-hop MST) problem, we are given a set S of n points in a metric space, a positive small integer k and a root point r ∈ S. We are intere...
115
click to vote
CCCG
2007
15 years 2 months ago
2007
Let S be a set system of convex sets in Rd . Helly’s theorem states that if all sets in S have empty intersection, then there is a subset S′ ⊂ S of size d+1 which also has e...