Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
104
click to vote
COMPGEOM
1993
ACM
107
views
Discrete Geometry
»
more
COMPGEOM 1993
»
Combinatorial Complexity of Translating a Box in Polyhedral 3-Space
15 years 7 months ago
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
more »
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)
Researcher Info
Discrete Geometry Study Group
Computer Vision