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
28
click to vote
COMPGEOM
1996
ACM
favorite
Email
discuss
report
80
views
Discrete Geometry
»
more
COMPGEOM 1996
»
Splitting a Complex of Convex Polytopes In Any Dimension
14 years 3 months ago
Download
www.pascucci.org
Chandrajit L. Bajaj, Valerio Pascucci
Real-time Traffic
COMPGEOM 1996
|
Discrete Geometry
|
claim paper
Related Content
»
Toric Varieties Hirzebruch Surfaces and ErrorCorrecting Codes
»
New Lower Bounds for Convex Hull Problems in Odd Dimensions
»
A general geometric construction of coordinates in a convex simplicial polytope
»
Polytopes and arrangements Diameter and curvature
»
On empty convex polygons in a planar point set
»
Polytope approximation and the Mahler volume
»
Maximum Entropy Coordinates for Arbitrary Polytopes
»
Metric Combinatorics of Convex Polyhedra Cut Loci and Nonoverlapping Unfoldings
»
Rigidity and the Lower Bound Theorem for Doubly CohenMacaulay Complexes
more »
Post Info
More Details (n/a)
Added
08 Aug 2010
Updated
08 Aug 2010
Type
Conference
Year
1996
Where
COMPGEOM
Authors
Chandrajit L. Bajaj, Valerio Pascucci
Comments
(0)
Researcher Info
Discrete Geometry Study Group
Computer Vision