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
122
Voted
COMPGEOM
1993
ACM
122
views
Discrete Geometry
»
more
COMPGEOM 1993
»
A Linear-Time Randomized Algorithm for the Bounded Voronoi Diagram of a Simple Polygon
15 years 7 months ago
Download
www.pi6.fernuni-hagen.de
For a polygon P, the bounded Voronoi diagram of P is a partition of P into regions assigned to the vertices of P. A point p inside P belongs to the region of a vertex v if and onl...
Rolf Klein, Andrzej Lingas
claim paper
Read More »