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
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
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
9
click to vote
COMPGEOM
1990
ACM
favorite
Email
discuss
report
59
views
Discrete Geometry
»
more
COMPGEOM 1990
»
Linear Programming and Convex Hulls Made Easy
13 years 9 months ago
Download
www.eecs.berkeley.edu
Raimund Seidel
Real-time Traffic
COMPGEOM 1990
|
Discrete Geometry
|
claim paper
Related Content
»
A Pivoting Algorithm for Convex Hulls and Vertex Enumeration of Arrangements and Polyhedra
»
Finite Disjunctive Programming Characterizations for General MixedInteger Linear Programs
»
Multipass geometric algorithms
»
Compact formulations as a union of polyhedra
»
Learning to rank using 1norm regularization and convex hull reduction
»
Cones of Matrices and Successive Convex Relaxations of Nonconvex Sets
»
Resolving Loads with Positive Interior Stresses
»
The Linear Programming Polytope of Binary Constraint Problems with Bounded TreeWidth
»
Stability in Discrete Tomography Linear Programming Additivity and Convexity
more »
Post Info
More Details (n/a)
Added
10 Aug 2010
Updated
10 Aug 2010
Type
Conference
Year
1990
Where
COMPGEOM
Authors
Raimund Seidel
Comments
(0)
Researcher Info
Discrete Geometry Study Group
Computer Vision