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
27
click to vote
STACS
1990
Springer
favorite
Email
discuss
report
96
views
Theoretical Computer Science
»
more
STACS 1990
»
On the Construction of Abstract Voronoi Diagrams
14 years 2 months ago
Download
www.mpi-inf.mpg.de
Kurt Mehlhorn, Stefan Meiser, Colm Ó'D&uacu
Real-time Traffic
STACS 1990
|
Theoretical Computer Science
|
claim paper
Related Content
»
Euclidean Voronoi diagram of 3D balls and its computation via tracing edges
»
A provably complete exploration strategy by constructing Voronoi diagrams
»
Computing the Implicit Voronoi Diagram in Triple Precision
»
Regionexpansion for the Voronoi diagram of 3D spheres
»
Constructing the City Voronoi Diagram Faster
»
Arrangements of geodesic arcs on the sphere
»
Estimation of the necessary number of points in Riemannian Voronoi
»
Constructing Approximate Voronoi Diagrams from Digital Images of Generalized Polygons and ...
»
An exploration strategy by constructing Voronoi diagrams with provable completeness
more »
Post Info
More Details (n/a)
Added
11 Aug 2010
Updated
11 Aug 2010
Type
Conference
Year
1990
Where
STACS
Authors
Kurt Mehlhorn, Stefan Meiser, Colm Ó'Dúnlaing
Comments
(0)
Researcher Info
Theoretical Computer Science Study Group
Computer Vision