Sciweavers

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

12

COMPGEOM
1993
ACM

favoriteEmaildiscussreport

107views Discrete Geometry» more COMPGEOM 1993»

Combinatorial Complexity of Translating a Box in Polyhedral 3-Space

13 years 8 months ago

Combinatorial Complexity of Translating a Box in Polyhedral 3-Space

Download acg.cs.tau.ac.il

Dan Halperin, Chee-Keng Yap

Real-time Traffic

COMPGEOM 1993 | Discrete Geometry |

claim paper

Related Content

» The union of moving polygonal pseudodiscs Combinatorial bounds and applications

» Matching Polyhedral Terrains Using Overlays of Envelopes

» A New Technique for Analyzing Substructures in Arrangements

Post Info
More Details (n/a)

Added	09 Aug 2010
Updated	09 Aug 2010
Type	Conference
Year	1993
Where	COMPGEOM
Authors	Dan Halperin, Chee-Keng Yap

Comments (0)