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
56
search results - page 12 / 12
»
Dynamic Structures for Top- k Queries on Uncertain Data
Sort
relevance
views
votes
recent
update
View
thumb
title
136
click to vote
COMPGEOM
2006
ACM
147
views
Discrete Geometry
»
more
COMPGEOM 2006
»
An optimal-time algorithm for shortest paths on a convex polytope in three dimensions
15 years 9 months ago
Download
www.tau.ac.il
We present an optimal-time algorithm for computing (an implicit representation of) the shortest-path map from a fixed source s on the surface of a convex polytope P in three dime...
Yevgeny Schreiber, Micha Sharir
claim paper
Read More »
« Prev
« First
page 12 / 12
Last »
Next »