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

The algorithm for three-dimensional Voronoi polyhedra

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

DOI10.1016/0021-9991(86)90123-3zbMath0615.65069OpenAlexW1985633170MaRDI QIDQ1820560

N. N. Medvedev

Publication date: 1986

Published in: Journal of Computational Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0021-9991(86)90123-3


zbMATH Keywords

algorithmconvex polyhedronVoronoi tessellationsVoronoi polyhedra


Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to convex and discrete geometry (52-04) Numerical methods for mathematical programming, optimization and variational techniques (65K99) Polytopes and polyhedra (52Bxx)




Cites Work

  • A new algorithm for three-dimensional Voronoi tessellation
  • Construction of Voronoi polyhedra
  • A procedure for the construction of Voronoi polyhedra
  • Computing Dirichlet Tessellations in the Plane
  • Unnamed Item
  • Unnamed Item


This page was built for publication: The algorithm for three-dimensional Voronoi polyhedra

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1820560&oldid=14183130"
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 10:45.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki