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
33
click to vote
SODA
2008
ACM
favorite
Email
discuss
report
105
views
Algorithms
»
more
SODA 2008
»
Distribution-sensitive point location in convex subdivisions
14 years 10 days ago
Download
www.scs.carleton.ca
A data structure is presented for point location in convex planar subdivisions when the distribution of queries is known in advance. The data structure has an expected query time that is within a constant factor of optimal.
Sébastien Collette, Vida Dujmovic, John Iac
Real-time Traffic
Algorithms
|
Convex Planar Subdivisions
|
Data Structure
|
Point Location
|
SODA 2008
|
claim paper
Related Content
»
Dynamic Trees and Dynamic Point Location
»
Nearly Optimal ExpectedCase Planar Point Location
»
Efficient ExpectedCase Algorithms for Planar Point Location
»
Physicsinspired topology changes for thin fluid features
more »
Post Info
More Details (n/a)
Added
30 Oct 2010
Updated
30 Oct 2010
Type
Conference
Year
2008
Where
SODA
Authors
Sébastien Collette, Vida Dujmovic, John Iacono, Stefan Langerman, Pat Morin
Comments
(0)
Researcher Info
Algorithms Study Group
Computer Vision