Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

93

CCCG
2003

68views Computational Geometry» more CCCG 2003»

On the worst-case complexity of the silhouette of a polytope

15 years 4 months ago

On the worst-case complexity of the silhouette of a polytope

Download www.loria.fr

We give conditions under which the worst-case size of the silhouette of a polytope is sub-linear.

Helmut Alt, Marc Glisse, Xavier Goaoc

Real-time Traffic

CCCG 2003 | CCCG 2007 | Polytope | Worst-case Size |

claim paper

Related Content

» On the Size of the 3D Visibility Skeleton Experimental Results

» On incremental rendering of silhouette maps of a polyhedral scene

» The union of moving polygonal pseudodiscs Combinatorial bounds and applications

» A New Practically Efficient Interior Point Method for LP

Post Info
More Details (n/a)

Added	31 Oct 2010
Updated	31 Oct 2010
Type	Conference
Year	2003
Where	CCCG
Authors	Helmut Alt, Marc Glisse, Xavier Goaoc

Comments (0)