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...

Full description

Bibliographic Details

Published in:	Computer graphics forum Vol. 31; no. 5; pp. 1627 - 1635
Main Author:	Sheehy, Donald R.
Format:	Journal Article
Language:	English
Published:	Oxford, UK Blackwell Publishing Ltd 01.08.2012
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!