New Bounds on the Size of Optimal Meshes

The theory of optimal size meshes gives a method for analyzing the output size (number of simplices) of a Delaunay refinement mesh in terms of the integral of a sizing function over the input domain. The input points define a maximal such sizing function called the feature size. This paper presents...

Celý popis

Podrobná bibliografia

Vydané v:	Computer graphics forum Ročník 31; číslo 5; s. 1627 - 1635
Hlavný autor:	Sheehy, Donald R.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Oxford, UK Blackwell Publishing Ltd 01.08.2012
Predmet:	Computer graphics F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problems-Geometrical problems and computations Initiatives Integrals Lower bounds Matching Mathematical analysis Mathematical functions Mathematical models Optimization Sizing Studies
ISSN:	0167-7055, 1467-8659
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!