Sciweavers

233 search results - page 19 / 47
» cccg 2007
Sort
View
CCCG
2006
13 years 8 months ago
On the Smallest Enclosing Information Disk
We present a generalization of Welzl's smallest enclosing disk algorithm [E. Welzl, Smallest enclosing disks (balls and ellipsoids), in: New Results and New Trends in Compute...
Frank Nielsen, Richard Nock
CCCG
2006
13 years 8 months ago
An Improved Approximation Factor For The Unit Disk Covering Problem
We present a polynomial time algorithm for the unit disk covering problem with an approximation factor 72, and show that this is the best possible approximation factor based on th...
Sada Narayanappa, Petr Vojtechovský
CCCG
2006
13 years 8 months ago
Another Paradigm for Geometric Constraints Solving
Geometric constraints solving often relies on graphbased methods to decompose systems of geometric constraints. These methods have intrinsic and unavoidable limitations which are ...
Dominique Michelucci, Sebti Foufou, Loïc Lama...
CCCG
2006
13 years 8 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 8 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