CCCG
2006
13 years 6 months ago
2006
We consider the problem of removing c points from a set S of n points so that the resulting point set has the smallest possible convex hull. Our main result is an O n 4c 2c (3c)c +...
CCCG
2006
13 years 6 months ago
2006
The problem of representing triangulations has been widely studied to obtain convenient encodings and space efficient data structures. In this paper we propose a new practical app...
CCCG
2006
13 years 6 months ago
2006
We analyze an extremely simple approximation algorithm for computing the minimum enclosing ball (or the 1-center) of a set of points in high dimensions. We prove that this algorit...
CCCG
2006
13 years 6 months ago
2006
CCCG
2006
13 years 6 months ago
2006
CCCG
2006
13 years 6 months ago
2006
Abstract. Given a set P of points and a set S of pairwise disjoint axis-parallel line segments in the plane, we construct a straight line spanning tree T on P such that every segme...
CCCG
2006
13 years 6 months ago
2006
A thrackle is a drawing of a simple graph on the plane, where each edge is drawn as a smooth arc with distinct end-points, and every two arcs have exactly one common point, at whi...
CCCG
2006
13 years 6 months ago
2006
We show that any tree whose maximum degree is at most 10 can be drawn in 3-space such that it is the minimum spanning tree of its vertices.
CCCG
2006
13 years 6 months ago
2006
Soss proved that it is NP-hard to find the maximum flat span of a fixed-angle polygonal chain: the largest distance achievable between the endpoints in a planar embedding. These f...
CCCG
2006
13 years 6 months ago
2006
Origami is the centuries-old art of folding paper, and recently, it is investigated as science. In this paper, another hundreds-old art of folding paper, a pop-up book, is studied...