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

The reduction principle in problems of computational geometry

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

zbMATH Open1199.65064MaRDI QIDQ3553099FDOQ3553099


Authors: V. M. Tereshchenko Edit this on Wikidata


Publication date: 22 April 2010





Recommendations

  • scientific article; zbMATH DE number 3864521
  • scientific article; zbMATH DE number 4037201
  • Construction of some computational algorithms on finite sets of points in the plane
  • scientific article; zbMATH DE number 2038819
  • scientific article; zbMATH DE number 3974322


zbMATH Keywords

computational geometrycompletenessalgorithm complexityreduction principleconversion problem


Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)



Cited In (1)

  • Partial reduction and Delaunay/Deprit variables





This page was built for publication: The reduction principle in problems of computational geometry

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3553099)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3553099&oldid=16938689"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 5 February 2024, at 01:23. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki