Properties of \(n\)-dimensional triangulations (Q578840): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Algorithm 623 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Algorithm 624 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Algorithm 526 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0167-8396(86)90001-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2046562952 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Method of Bivariate Interpolation and Smooth Surface Fitting for Irregularly Distributed Data Points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three- and four-dimensional surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: A storage-efficient method for construction of a Thiessen triangulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Dirichlet Tessellations in the Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4194442 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(C^ 1\) surface interpolation for scattered data on a sphere / rank
 
Normal rank
Property / cites work
 
Property / cites work: A triangle-based \(C^ 1\) interpolation method / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:00, 18 June 2024

scientific article
Language Label Description Also known as
English
Properties of \(n\)-dimensional triangulations
scientific article

    Statements

    Properties of \(n\)-dimensional triangulations (English)
    0 references
    0 references
    1986
    0 references
    This paper establishes a number of mathematical results relevant to the problem of constructing a triangulation, i.e., a simplicial tesselation of the convex hull of an arbitrary finite set of points in n-space. The principal results of the present paper are (a) A set of \(n+2\) points in n-space may be triangulated in at most 2 different ways. (b) The `sphere test' defined in this paper selects a preferred one of these two triangulations. (c) A set of parameters is defined that permits the characterization and enumeration of all sets of \(n+2\) points in n-space that are significantly different from the point of view of their possible triangulations. (d) The local sphere test induces a global sphere test property for a triangulation. (e) A triangulation satisfying the global sphere property is dual to the n-dimensional Dirichlet tesselation, i.e., it is a Delaunay triangulation.
    0 references
    triangulation
    0 references
    simplicial tesselation of the convex hull
    0 references
    sphere test
    0 references
    Dirichlet tesselation
    0 references
    Delaunay triangulation
    0 references

    Identifiers