Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
CCCG
2006
11 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
11 years 7 months ago
2D Triangulation Representation Using Stable Catalogs
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...
Abdelkrim Mebarki, Luca Castelli Aleardi, Olivier ...
CCCG
2006
11 years 7 months ago
A Simple Streaming Algorithm for Minimum Enclosing Balls
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...
Hamid Zarrabi-Zadeh, Timothy M. Chan
CCCG
2006
11 years 7 months ago
Curves in the Sand: Algorithmic Drawing
Mirela Damian, Erik D. Demaine, Martin L. Demaine,...
CCCG
2006
11 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
CCCG
2006
11 years 7 months ago
A Study of Conway's Thrackle Conjecture
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...
Wei Li 0011, Karen Daniels, Konstantin A. Rybnikov
CCCG
2006
11 years 7 months ago
Realization of Degree 10 Minimum Spanning Trees in 3-Space
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.
James A. King
CCCG
2006
11 years 7 months ago
On the Maximum Span of Fixed-Angle Chains
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...
Nadia Benbernou, Joseph O'Rourke
CCCG
2006
11 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
books