Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

On parallel complexity of planar triangulations

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

DOI10.1007/3-540-60692-0_64zbMath1354.68281OpenAlexW1517009731MaRDI QIDQ2956699

Cao Wang, Andrzej Lingas, Christos Levcopoulos

Publication date: 19 January 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60692-0_64




Mathematics Subject Classification ID

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



Related Items (1)

PARALLEL CONSTRUCTION OF QUADTREES AND QUALITY TRIANGULATIONS





This page was built for publication: On parallel complexity of planar triangulations

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