Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

On the expected complexity of voronoi diagrams on terrains

From MaRDI portal
Publication:2874572
Jump to:navigation, search

DOI10.1145/2261250.2261266zbMath1293.68287OpenAlexW1970054376MaRDI QIDQ2874572

Anne Driemel, Benjamin Raichel, Sariel Har-Peled

Publication date: 7 August 2014

Published in: Proceedings of the twenty-eighth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2261250.2261266


zbMATH Keywords

Voronoi diagramcombinatorial complexityterrains


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)


Related Items (1)

On the complexity of randomly weighted multiplicative Voronoi diagrams






This page was built for publication: On the expected complexity of voronoi diagrams on terrains

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2874572&oldid=15820030"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 19:28.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki