Sciweavers

39 search results - page 3 / 8
» cccg 2006
Sort
View
CCCG
2006
13 years 7 months ago
Routing with Guaranteed Delivery on Virtual Coordinates
We propose four simple algorithms for routing on planar graphs using virtual coordinates. These algorithms are superior to existing algorithms in that they are oblivious, work als...
Mirela Ben-Chen, Craig Gotsman, Steven J. Gortler
CCCG
2006
13 years 7 months ago
The Complexity of a Pop-Up Book
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...
Ryuhei Uehara, Sachio Teramoto
CCCG
2006
13 years 7 months ago
Removing Outliers to Minimize Area and Perimeter
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 +...
Rossen Atanassov, Pat Morin, Stefanie Wuhrer
CCCG
2006
13 years 7 months ago
Small Weak Epsilon-Nets in Three Dimensions
We study the problem of finding small weak -nets in three dimensions and provide new upper and lower bounds on the value of for which a weak -net of a given small constant size e...
Maryam Babazadeh, Hamid Zarrabi-Zadeh
CCCG
2006
13 years 7 months ago
Spanning trees across axis-parallel segments
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...
Csaba D. Tóth, Michael Hoffmann