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

Computing optimal diameter-bounded polygon partitions

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

DOI10.1007/S00453-004-1092-3zbMath1090.68111OpenAlexW2002602645MaRDI QIDQ1882473

Sriram V. Pemmaraju, Mirela Damian

Publication date: 1 October 2004

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-004-1092-3


zbMATH Keywords

approximation algorithmpolygon decomposition


Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)








This page was built for publication: Computing optimal diameter-bounded polygon partitions

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