Sciweavers

CCCG
2004
14 years 26 days ago
On the number of line tangents to four triangles in three-dimensional space
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...
Hervé Brönnimann, Olivier Devillers, S...
CCCG
2004
14 years 26 days ago
On computing enclosing isosceles triangles and related problems
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...
Prosenjit Bose, Carlos Seara, Saurabh Sethia
CCCG
2004
14 years 26 days ago
Making contour trees subdomain-aware
Nathanael Berglund, Andrzej Szymczak
CCCG
2004
14 years 26 days ago
Unfolding polyhedral bands
Greg Aloupis, Erik D. Demaine, Stefan Langerman, P...
CCCG
2004
14 years 26 days ago
Computing nice sweeps for polyhedra and polygons
Prosenjit Bose, Marc J. van Kreveld
CCCG
2007
14 years 28 days ago
Approximating k-hop Minimum Spanning Trees in Euclidean Metrics
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...
Sören Laue, Domagoj Matijevic
CCCG
2007
14 years 28 days ago
Contraction and Expansion of Convex Sets
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...
Michael Langberg, Leonard J. Schulman