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

Linear-time reconstruction of Delaunay triangulations with applications

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

DOI10.1007/3-540-63397-9_35zbMath1477.68493OpenAlexW1568814373MaRDI QIDQ826118

Jack Scott Snoeyink, Marc J. van Kreveld

Publication date: 20 December 2021

Full work available at URL: https://doi.org/10.1007/3-540-63397-9_35


zbMATH Keywords

spanning treeVoronoi diagramplanar graphcomputational geometrygeographic information system


Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)


Related Items (3)

Spanning trees crossing few barriers ⋮ Tight bounds for connecting sites across barriers ⋮ Fast reconstruction of Delaunay triangulations







This page was built for publication: Linear-time reconstruction of Delaunay triangulations with applications

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