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
110
click to vote
COMPGEOM
2005
ACM
93
views
Discrete Geometry
»
more
COMPGEOM 2005
»
Exact Minkowski sums of convex polyhedra
15 years 4 months ago
Download
www.cs.uu.nl
Efi Fogel, Dan Halperin
Real-time Traffic
COMPGEOM 2005
|
Discrete Geometry
|
claim paper
Related Content
»
On the exact maximum complexity of Minkowski sums of convex polyhedra
»
Fast and robust retrieval of Minkowski sums of rotating convex polyhedra in 3space
»
Minkowski sums of rotating convex polyhedra
»
PointBased Minkowski Sum Boundary
»
Deconstructing approximate offsets
more »
Post Info
More Details (n/a)
Added
13 Oct 2010
Updated
13 Oct 2010
Type
Conference
Year
2005
Where
COMPGEOM
Authors
Efi Fogel, Dan Halperin
Comments
(0)
Researcher Info
Discrete Geometry Study Group
Computer Vision