SIGN IN
SIGN UP
Divide-and-conquer for Voronoi diagrams revisited
Full Text:
Pdf
Buy this Article
Authors:
Oswin Aichholzer
IST, Graz University of Technology , Graz, Austria
Wolfgang Aigner
IST, Graz University of Technology , Graz, Austria
Franz Aurenhammer
IGI, Graz University of Technology, Graz, Austria
Thomas Hackl
IST, Graz University of Technology, Graz, Austria
Bert Jüttler
AG, Johannes Kepler University, Linz, Austria
Elisabeth Pilgerstorfer
AG, Johannes Kepler University, Linz, Austria
Margot Rabl
AG, Johannes Kepler University, Linz, Austria
2009 Article
Bibliometrics
· Downloads (6 Weeks): 3
· Downloads (12 Months): 40
· Downloads (cumulative): 291
· Citation Count: 3
Published in:
· Proceeding
SCG '09
Proceedings of the 25th annual symposium on Computational geometry
Pages 189-197
ACM
New York, NY
, USA
©2009
table of contents
ISBN: 978-1-60558-501-7
doi>
10.1145/1542362.1542401
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
SoCG '13
Share:
|
Tags:
algorithms
biarc approximation
divide-and-conquer
geometrical problems and computations
medial axis
motion planning
theory
trimmed offset
voronoi diagram
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder