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
34
click to vote
COMPGEOM
1996
ACM
favorite
Email
discuss
report
117
views
Discrete Geometry
»
more
COMPGEOM 1996
»
Approximating Shortest Paths on a Convex Polytope in Three Dimensions
14 years 3 months ago
Download
www.cs.ubc.ca
Sariel Har-Peled, Micha Sharir, Kasturi R. Varadar
Real-time Traffic
COMPGEOM 1996
|
Discrete Geometry
|
claim paper
Related Content
»
Constructing Approximate Shortest Path Maps in Three Dimensions
»
An optimaltime algorithm for shortest paths on a convex polytope in three dimensions
»
Sublinear geometric algorithms
»
Computing approximate shortest paths on convex polytopes
»
Metric Combinatorics of Convex Polyhedra Cut Loci and Nonoverlapping Unfoldings
more »
Post Info
More Details (n/a)
Added
08 Aug 2010
Updated
08 Aug 2010
Type
Conference
Year
1996
Where
COMPGEOM
Authors
Sariel Har-Peled, Micha Sharir, Kasturi R. Varadarajan
Comments
(0)
Researcher Info
Discrete Geometry Study Group
Computer Vision